The goal of this paper is to present a panorama of some recent combinatorial results that we first discovered through experimentation with symbolic computation software. Each statement presented here has been rigorously proved using standard methods. Emphasis is laid on the (self-contained) descript
Computer Algebra Libraries for Combinatorial Structures
β Scribed by Philippe Flajolet; Bruno Salvy
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 652 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
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 (LUO, combstruct, equivalent). In addition, libraries for manipulating holonomic sequences and functions are presented (gfun, Mgfun).
π SIMILAR VOLUMES
The Orlik-Solomon algebra A(G) of a matroid G is the free exterior algebra on the points, modulo the ideal generated by the circuit boundaries. On one hand, this algebra is a homotopy invariant of the complement of any complex hyperplane arrangement realizing G. On the other hand, some features of t