|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'503'724
Articles rated: 2609
23 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Generating functions for generating trees | | Cyril Banderier
; Philippe Flajolet
; Daniele Gardy
; Mireille Bousquet-Melou
; Alain Denise
; Dominique Gouyou-Beauchamps
; | | Date: |
11 Nov 2004 | | Journal: | Discrete Mathematics 246 (1-3) (2002) 29-55 | | Subject: | Combinatorics; Data Structures and Algorithms | math.CO cs.DS | | Affiliation: | LIPN, ALGO UR-R), Philippe Flajolet (ALGO UR-R), Daniele Gardy (PRISM), Mireille Bousquet-Melou (LABRI), Alain Denise (LRI), Dominique Gouyou-Beauchamps (LRI | | Abstract: | Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. Generating trees lead to a fast computation of enumeration sequences (sometimes, to explicit formulae as well) and provide efficient random generation algorithms. We investigate the links between the structural properties of the rewriting rules defining such trees and the rationality, algebraicity, or transcendence of the corresponding generating function. | | Source: | arXiv, math.CO/0411250 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER