Algolib: The Algorithms Project’s Library and Other Packages of the Algorithms Project. Combinatorial analysis, discrete mathematics and computer algebra are the main interests of the Algorithms Project. Our packages let you specify, generate, and enumerate combinatorial structures; manipulate the associated generating functions, functional equations or recurrences; study their asymptotic behaviour. The interplay between these applications serves the Algorithms Project’s main goal of the automatic complexity analysis of algorithms. However, long-term research in this direction has induced the development of other packages for the manipulation of linear differential and difference operators, Groebner basis calculations, and the symbolic summation and integration of special functions and combinatorial sequences. Special emanations of the above are the Algolib library, which collects most of our programs in a single archive, and the encyclopedia of combinatorial structures, which allows access by keywords, combinatorial specifications, generating function, closed-form or by the first integers in the enumeration sequence to many combinatorial structures. A lot of it was automatically generated using combstruct, gfun, and gdev. Studies in Automatic Combinatorics are extensive example sessions that serve as an introduction to the use of our packages, together with advanced sessions illustrating their use in the study of combinatorics, special functions or asymptotic analysis. Also available as Maple help pages in the Algolib library.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Mahboubi, Assia; Sibut-Pinote, Thomas: A formal proof of the irrationality of (\zeta(3)) (2021)
- Chyzak, Frédéric; Mahboubi, Assia; Sibut-Pinote, Thomas; Tassi, Enrico: A computer-algebra-based formal proof of the irrationality of (\zeta(3)) (2014)
- Sloane, N. J. A.; Wieder, Thomas: The number of hierarchical orderings (2004)