Search for Topics All Reviews
	Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Combinatorics (G.2.1) > Generating Functions (G.2.1...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-6 of 6 Reviews about "Generating Functions (G.2.1...)": Date Reviewed   A palindromization map for the free group Kassel C., Reutenauer C. Theoretical Computer Science 409(3): 461-470, 2008.  Type: Article This paper is in the area of discrete mathematics. It describes a self map of a free group, referred to as a palindromization map (Pal). Various properties of Pal are proved: braid groups, profinite topology, and cohomological interpre... Apr 13 2009   Greedy sums of distinct squares Montgomery H., Vorhauer U. Mathematics of Computation 73(245): 493-513, 2004.  Type: Article In this mathematical tour de force, the authors prove distribution properties of greedy sums of distinct squares (GSDSs), a subject that would seem to have received scant attention in the literature. A positive integer is a GSDS if the... Apr 14 2004   Automatic average-case analysis of algorithms Flajolet P., Salvy B., Zimmermann P. Theoretical Computer Science 79(1): 37-109, 1991.  Type: Article Automatic analysis is useful in several instances, including finding the average number of cycles in a random permutation of n elements, determining the path length in a random heap-ordered tree of n elements (quicksort),... Mar 1 1992   Symbolic summation with generating functions R. A. J., Lamagna E.  Symbolic and algebraic computation (, Portland, OR, Jul 17-19, 1989) 2331989.  Type: Proceedings As part of a long-term project to develop an interactive system to assist with the analysis of algorithms, the authors are studying the use of generating functions to perform symbolic summation. This paper discusses certain aspects of ... Oct 1 1991   Generating functionology Wilf H., Academic Press Prof., Inc., San Diego, CA, 1990.  Type: Book (9780127519555) As the author points out, generating functions are a bridge between discrete mathematics and continuous analysis. This book is intended for advanced undergraduates and is also appropriate for graduate students. Researchers who use gene... Feb 1 1991   Generating binary trees of bounded height Lee C., Lee D., Wong C. Acta Informatica 23(5): 529-544, 1986.  Type: Article Generating binary trees, in lexicographic order, has been studied before. In this paper, the same problem is considered with the additional constraint that the height is bounded by a given number. A level numbering of nodes is used to ... Aug 1 1987       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy