Published:
The Rocky Mountain Mathematics Consortium, 2005
Published in:
The Rocky Mountain Journal of Mathematics, 35 (2005) 3, Seite 1029-1042
Language:
English
ISSN:
1945-3795;
0035-7596
Origination:
Footnote:
Description:
We study a class of integer matrices that define Gorenstein lattice ideals. We call them Gorenstein matrices. We give a combinatorial characterization of those which are of size (n + 1) × n and we relate them to the Frobenius problem in integer programming theory. We also give a necessary and sufficient condition for Gorensteinness of generic matrices which are defined in integer programming theory.