Matrices defining Gorenstein lattice ideals (Q2566536)

The authors study the class of Gorenstein matrices which is more general than the class of complete intersection matrices. In section 2, they show that the lattice ideal has a bigraded structure. In section 3, first they show that the Cohen-Macaulay type of an integer \((n+1)\times n\)-matrix \(B\) is equal to the number of maximal lattice point free polytopes of fibers. Then as a consequence they give a combinatorial characterization of Gorenstein matrices of size \((n+1)\times n\) in terms of maximal lattice point free polytopes. The geometric significance of this class of matrices is due to affine monomial curves. As an application the authors use this characterization to solve some special cases of the Frobenius problem. In section 4, they study Gorensteinness of a generic matrix which is defined in integer programming theory. They show that Gorenstein generic matrices are precisely column matrices with some special properties.