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 :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00074178
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:41:06 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Tuesday, April 12, 2011 - 3:43:53 PM

Identifiers

  • HAL Id : inria-00074178, version 1

Collections

Citation

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

Share

Metrics

Record views

145

Files downloads

283