Machine calculations in Weyl groups.
Matrix rank certification.
Mémoire sur l'intégration d'une classe de fonctions transcendantes.
Minimal resolutions of lattice ideals and integer linear programming.
A combinatorial description of the minimal free resolution of a lattice ideal allows us to the connection of Integer Linear Programming and Al1gebra. The non null reduced homology spaces of some simplicial complexes are the key. The extremal rays of the associated cone reduce the number of variables.
Minimum complexity of automatic non sturmian sequences
MOP -- algorithmic modality analysis for parabolic actions.