Abstract
A configuration of lattice vectors is supernormal if it contains a Hilbert basis for every pointed cone spanned by a subset. We study such configurations from various perspectives, including triangulations, integer programming and Gröbner bases. Our main result is a bijection between virtual chambers of the configuration and virtual initial ideals of the associated binomial ideal.
Article PDF
Similar content being viewed by others
References
L.J. Billera, P. Filliman, and B. Sturmfels, “Constructions and complexity of secondary polytopes,” Advances in Mathematics 83(2) (1990), 155–179.
L.J. Billera, I.M. Gel’fand, and B. Sturmfels, “Duality and minors of secondary polyhedra,” J.Combin.Theory Ser.B 57(2) (1993), 258–268.
J.A. de Loera, S. Hoşten, F. Santos, and B. Sturmfels, “The polytope of all triangulations of a point configuration,” Documenta Mathematica 1(4) (1996), 103–119 (electronic).
S. Hoşten and R.R. Thomas, “The associated primes of initial ideals of lattice ideals,” Mathematical Research Letters 6 (1999), 83–97.
S. Hoşten and D. Maclagan, “The vertex ideal of a lattice,” Advances in Applied Mathematics 29 (2002), 521–538.
M. Saito, B. Sturmfels, and N. Takayama, Gröbner Deformations of Hypergeometric Differential Equations, Springer, Heidelberg, 2000.
A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons Ltd., Chichester, 1986.
B. Sturmfels, Gröbner Bases and Convex Polytopes, American Mathematical Society, Providence, RI, 1996.
B. Sturmfels and R.R. Thomas, “Variation of cost functions in integer programming,” Math.Programming 77(3, Ser. A) (1997), 357–387.
G. Ziegler, Lectures on Polytopes, Springer Verlag, Heidelberg, 1995.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hoşten, S., Maclagan, D. & Sturmfels, B. Supernormal Vector Configurations. J Algebr Comb 19, 297–313 (2004). https://doi.org/10.1023/B:JACO.0000030705.93448.ce
Issue Date:
DOI: https://doi.org/10.1023/B:JACO.0000030705.93448.ce