hal-00003258, version 1
Generating functions for generating trees
Discrete Mathematics 246 (1-3) (2002) 29-55
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.
- 1:
- CNRS : UMR7030 – Université Paris XIII - Paris Nord
- 2:
- INRIA
- 3:
- INRIA – CNRS : UMR8144 – Université de Versailles Saint-Quentin-en-Yvelines
- 4:
- CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II
- 5:
- CNRS : UMR8623 – Université Paris XI - Paris Sud
- Domain : Mathematics/Combinatorics
Computer Science/Data Structures and Algorithms - Comment : This article corresponds – up to minor typo corrections – to the article submitted to Discrete Mathematics (Elsevier) in Nov. 1999 – and published in its vol. 246(1-3) – March 2002 – pp. 29-55.
- hal-00003258, version 1
- http://hal.archives-ouvertes.fr/hal-00003258
- oai:hal.archives-ouvertes.fr:hal-00003258
- From:
- Submitted on: Wednesday, 10 November 2004 20:08:54
- Updated on: Friday, 8 June 2007 18:03:23





Associated documents

Export