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.
The Algolib library collects Maple packages developed by the Algo team at INRIA. It currently contains combstruct, encyclopedia, gdev, gfun, Groebner, Holonomy, Mad, Mgfun, MultiSeries, NumGfun, Ore_algebra, and regexpcount. These packages (and more) are described below. An on-line version of the encyclopedia is also available.
Algolib, version 17.0 (July 9, 2013). For Maple17.
Released under the GNU Lesser General Public License
(LGPL v2.1).
[ readme | Maple library | Maple help pages | tar of source code | tar.gz of source code ] | |
Note that you don't need the source code for installing Algolib, only the library and help pages (.mla and .hdb files).
If you use Algolib, we would be more than glad if you could let us know about the work you do and on the use and applications you plan with Algolib.
gfun
package is used for the manipulation and discovery of
generating functions. Written by Bruno Salvy,
Paul Zimmermann and Eithne Murray.
Contact: gfun@inria.fr.
It has its own site that you might want to check for the most recent version and many real-life examples.
Ore_algebra
and
Groebner
have been incorporated into the core library of
MapleV Release 5, as a replacement for the former
grobner
package. The whole set of packages is part of
the Algolib library. Written by Frédéric Chyzak.
Regexpcount is a package dedicated to regular expressions and automatas described in the combstruct syntax; in the case of automatas, this facilitates translation to generating functions. Regexpcount provides also access to the internal structures of automatas described as maple tables. When counting the number of occurrences of motifs or regular expressions in random sequences, the underlying probabilistic model of the sequences is Bernoulli or Markov.
equivalent
function mentioned in the survey article. equivalent
does
asymptotic expansion of Taylor coefficients, useful in the study of generating
functions. Written by Bruno Salvy.
gdev
functions,
including examples.
gdev
luo
system.
luo