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}).
Type de document :
[Research Report] RR-2497, INRIA. 1995
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:41:06
Dernière modification le : vendredi 25 mai 2018 - 12:02:02
Document(s) archivé(s) le : mardi 12 avril 2011 - 15:43:53



  • HAL Id : inria-00074178, version 1



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



Consultations de la notice


Téléchargements de fichiers