Minimal presentations

[pedritomelenas]

The package provides two ways for computing minimal presentations. One is via Apéry sets and non-connected graphs (Betti elements), while the other uses elimination of variables in ideals of polynomials.
The first approach is faster when the number of generators is high and the multiplicity is small. However, in general, the elimination approach is faster, even more if one loads singular or 4ti2interface.
We should at some point decide what to do with this, or try to improve the Apéry set approach by using dynamic factorizations.

[amroblesperez]

Package manual, last line of "4.1-1 MinimalPresentation": "The last element..." instead of "The first element..."?

[pedritomelenas]

Thank you.
Yes, you are right. We should change this sentence, since now all minimal presentations and the pairs of the minimal presentations are arranged by using lexicographical order, and that sentence was written for an old version of MinimalPresentation.