Computer Algebra Libraries for Combinatorial Structures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

Computer Algebra Libraries for Combinatorial Structures

Philippe Flajolet
  • Function : Author
  • PersonId : 829512
Bruno Salvy


This paper introduces the framework of decomposable combinatorial structures and their traversal algorithms. A combinatorial type is decomposable if it admits a specification in terms of unions, products, sequences, sets, and cycles, either in the labelled or in the unlabelled context. Many properties of decomposable structures are decidable. Generating function equations, counting sequences, and random generation algorithms can be compiled from specifications. Asymptotic properties can be determined automatically for a reasonably large subclass. Maple libraries that implement such decision procedures are briefly surveyed ({\tt LUO, combstruct, equivalent}). In addition, libraries for manipulating holonomic sequences and functions are presented~({\tt gfun, Mgfun}).


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2497.pdf (423.64 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00074178 , version 1


Philippe Flajolet, Bruno Salvy. Computer Algebra Libraries for Combinatorial Structures. [Research Report] RR-2497, INRIA. 1995. ⟨inria-00074178⟩
53 View
186 Download


Gmail Facebook Twitter LinkedIn More