We show how Dickson's lemma yields an algorithm for computing the general N-solution to
a linear system over Z. The method is based in determining several particular solutions. We …

The short resolution of a lattice ideal is a free resolution over a polynomial ring whose
number of variables is the number of extremal rays in the associated cone. A combinatorial …

We give a method for computing the degrees of the minimal syzygies of a toric variety by
means of combinatorial techniques. Indeed, we complete the explicit description of the …

Toric geometry is a subject of increasing activity. Toric varieties are objects on which one
usually can check explicitly properties and compute invariants from algebraic geometry. This …

We compute the first syzygies of a subclass of lattice ideals by means of some abstract
simplicial complexes. This subclass includes the ideals defining toric varieties. A finite check …

Atoms of the set of numerical semigroups with fixed Frobenius number Page 1 Linear Algebra and
its Applications 430 (2009) 41–51 Available online at www.sciencedirect.com …

We compute the degrees of the syzygies of lattice ideals by means of some simplicial
complexes. The vertex sets of these complexes are subsets of the extremal rays of the …

The paper considers a linear Diophantine equation. A method (algorithm) for finding a
general class of solutions of equation is proposed. The proposed algorithm is explained by …

Index of nilpotency of binomial ideals Page 1 Journal of Algebra 255 (2002) 135–147 www.academicpress.com
Index of nilpotency of binomial ideals Ignacio Ojeda Martínez de Castillaa,∗,1 and Ramón …

Motivation, theoretic and software development The resolution of systems of linear
Diophantine equations is a well known complex problem with many applications. In this …