On Generating Functions of Generating Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

On Generating Functions of Generating Trees

Cyril Banderier
Mireille Bousquet-Mélou
Alain Denise
Philippe Flajolet
  • Function : Author
  • PersonId : 829512
Danièle Gardy
Dominique Gouyou-Beauchamps
  • Function : Author


Generating trees describe conveniently certain families of combinatorial objects: 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) while providing efficient random generation algorithms. In this paper, we investigate the relationship between structural properties of the rules defining such trees and the rationality, algebraicity, or transcendence of the corresponding generating functions.
Fichier principal
Vignette du fichier
RR-3661.pdf (432.23 Ko) Télécharger le fichier

Dates and versions

inria-00073011 , version 1 (24-05-2006)


  • HAL Id : inria-00073011 , version 1


Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, et al.. On Generating Functions of Generating Trees. [Research Report] RR-3661, INRIA. 1999. ⟨inria-00073011⟩
61 View
104 Download


Gmail Facebook X LinkedIn More