Minimal resolutions of lattice ideals and integer linear programming

DOI10.4171/RMI/347zbMath1094.13017MaRDI QIDQ1884028

Alberto Vigneron-Tenorio, Pilar Pisón-Casares, Emilio Briales-Morales, Antonio Campillo

Publication date: 25 October 2004

Published in: Revista Matemática Iberoamericana (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/39592

zbMATH Keywords

simplicial complexinteger linear programmingsyzygyresolutionslattice ideal

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Syzygies, resolutions, complexes and commutative rings (13D02)

Related Items

Simplicial complexes and minimal free resolution of monomial algebras, Antonio Campillo

Uses Software

• GRIN

Cites Work

• A criterion for detecting m-regularity
• Linear free resolutions and minimal multiplicity
• Efficient solution of linear diophantine equations
• Semigroup ideals and linear Diophantine equations
• Combinatoric of syzygies for semigroup algebras
• Strategies for computing minimal free resolutions
• Syzygies of codimension 2 lattice ideals
• An efficient incremental algorithm for solving systems of linear diophantine equations
• Minimal systems of generators for ideals of semigroups
• Cellular binomial ideals. Primary decomposition of binomial ideals
• Gröbner bases of toric varieties
• \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\)
• Index of nilpotency of binomial ideals.
• Combinatorics and commutative algebra.
• Free resolutions and Koszul homology
• Binomial ideals
• Syzygies of affine toric varieties
• Generators and relations of abelian semigroups and semigroup rings
• Sysygies of unimodular Lawrence ideals
• FIRST SYZYGIES OF TORIC VARIETIES AND DIOPHANTINE EQUATIONS IN CONGRUENCE
• On the complexity of integer programming
• Higher order relations for a numerical semigroup
• On the foundations of linear and integer linear programming I
• Cellular resolutions of monomial modules
• Recent developments in toric geometry
• Equations Defining Toric Varieties
• Generic lattice ideals
• The short resolution of a lattice ideal
• An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
• The Value-Semigroup of a One-Dimensional Gorenstein Ring
• The regularity of a toric variety
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item