Skip to Main content Skip to Navigation

Computer Algebra Libraries for Combinatorial Structures

Philippe Flajolet 1 Bruno Salvy 1 
1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : 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}).
Document type :
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:41:06 PM
Last modification on : Thursday, February 3, 2022 - 11:14:20 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 3:43:53 PM


  • HAL Id : inria-00074178, version 1



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



Record views


Files downloads