Matrices defining Gorenstein lattice ideals
DOI10.1216/rmjm/1181069720zbMath1084.52010OpenAlexW2016630948MaRDI QIDQ2566536
Hossein Sabzrou, Farhad Rahmati
Publication date: 26 September 2005
Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1216/rmjm/1181069720
integer programmingFrobenius problemlattice idealsgeneric matricesGorenstein matricesnumber of maximal lattice point free polytopesthe polytope of a fiber
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Syzygies of codimension 2 lattice ideals
- Mixed dominating matrices
- Primary decomposition of lattice basis ideals
- Generic and cogeneric monomial ideals
- The associated primes of initial ideals of lattice ideals
- Mixed matrices and binomial ideals
- Binomial arithmetical rank of lattice ideals
- Matrices with Identical Sets of Neighbors
- Some results about symmetric semigroups
- The Frobenius Problem and Maximal Lattice Free Bodies
- Neighbors of the Origin for Four by Three Matrices
- $F_{\Delta }$ type free resolutions of monomial ideals
- A note on Symmetric Semigroups and almost arithmetic sequences
- The frobenius number of some semigroups
- Affine semigroup rings that are complete intersections
- Generic lattice ideals
- Combinatorial Commutative Algebra