Abstract
The algebraic technique of Gröbner bases is applied to study triangulations of the second hypersimplex Δ(2,n). We present a quadratic Gröbner basis for the associated toric idealK(K n ). The simplices in the resulting triangulation of Δ(2,n) have unit volume, and they are indexed by subgraphs which are linear thrackles [28] with respect to a circular embedding ofK n . Forn≥6 the number of distinct initial ideals ofI(K n ) exceeds the number of regular triangulations of Δ(2,n); more precisely, the secondary polytope of Δ(2,n) equals the state polytope ofI(K n ) forn≤5 but not forn≥6. We also construct a non-regular triangulation of Δ(2,n) forn≥9. We determine an explicit universal Gröbner basis ofI(K n ) forn≤8. Potential applications in combinatorial optimization and random generation of graphs are indicated.
Similar content being viewed by others
References
D. Bayer, andI. Morrison: Gröbner Bases and Geometric Invariant Theory I.,J. of Symbolic Computation,6 (1988), 209–217.
D. Bayer, M. Stillman, andM. Stillman:Macaulay User Manual. Cornell University, 1989.
L. Billera, P. Filliman, andB. Sturmfels: Constructions and Complexity of Secondary Polytopes,Adv. in Math.,83 (1990), 155–179.
L. Billera, I.M. Gel'fand, andB. Sturmfels: Duality and Minors of Secondary Polyhedra,J. Comb. Theory B.57 2 (1993), 258–268.
P. Conti, andC. Traverso: Buchberger Algorithm and Integer Programming, Proceedings AAECC-9 (New Orleans), Springer Verlag LNCS 539, 1991, 130–139.
D. Cox, J. Little, andD. O'Shea:Ideals, Varieties and Algorithms, Springer Undergraduate Texts in Mathematics, 1992.
P. Diaconis, andB. Sturmfels: Algebraic Algorithms for Generating from Conditional Distributions, to appear inAnnals of Statistics.
P. Diaconis, R. L. Graham, andB. Sturmfels: Primitive Partition Identities, to appear in “Paul Erdös is 80”, Vol. II, Bolyai Soc.
H. Flaschka, andL. Haine: Torus orbits inG/P, Pacific J. Math. 149 (1991), 251–292.
I. M. Gel'fand, M. M. Kapranov, andA. V. Zelevinsky: Discriminants of Polynomials in Several Variables and Triangulations of Newton Polytopes,Algebra i analiz (Leningrad Math. Journal),2 (1990), 1–62.
I. M. Gel'fand, M. M. Kapranov, andA. V. Zelevinsky: Hypergeometric functions and Toric Varieties,Funct. Anal. Appl. 23 No. 2, (1989), 12–26.
I. M. Gel'fand, M. M. Kapranov, andA. V. Zelevinsky:Multidimensional Determinants, Discriminants and Resultants, Birkhäuser, Boston, 1994.
F. Harary:Graph Theory. Addison-Wesley, Reading 1972.
M. M. Kapranov, B. Sturmfels, andA. V. Zelevinsky: Chow Polytopes and General Resultants,Duke Math. Journal,67 (1992), 189–218.
C. W. Lee: Regular Triangulations of Convex Polytopes,Applied Geometry and Discrete Mathematics-The Victor Klee Festschrift, (P. Gritzmann and B. Sturmfels eds.) Dimacs Series in Discrete Math. and Theoretical Comp. Science,4 (1991), 443–456.
L. Lovász, andM.D. Plummer:Matching Theory, North-Holland Mathematics Studies 121, Annals of Discrete Mathematics (29), New York 1986.
A. Sinclair:Algorithms for Random Generation and Counting: a Markov Chain Approach, Birkhäuser, Boston, 1993.
A. Simis, W. Vasconcelos, andR. Villarreal: On the Ideal Theory of Graphs,Journal of Algebra, to appear.
R. Stanley:Combinatorics and Commutative Algebra, Birkhäuser, Boston, 1983.
R. Stanley: Eulerian Partitions of the Unit Hypercube, inHigher Combinatorics, (M. Aigner, ed.), D. Reidel, Dordrecht-Holland, 1977, 49.
B. Sturmfels: Gröbner Bases of Toric Varieties,Tôhoku Math. J.,43 (2) (1991), 249–261.
B. Sturmfels: Asymptotic Analysis of Toric Ideals,Memoirs of the Faculty of Science, Kyushu University Ser. A,46, (1992), 217–228.
B. Sturmfels: Sparse Elimination Theory,Computational Algebraic Geometry and Commutative Algebra, (D. Eisenbud and L. Robbiano, eds.), Proceedings Cortona June 1991, Cambridge University Press (1993), 264–298.
B. Sturmfels: Some Applications of Affine Gale Diagrams to Polytopes with Few Vertices,SIAM J. Discrete Math.,1 (1988), 121–133.
B. Sturmfels, andR. R. Thomas: Variation of Cost Functions in Integer Programming, Manuscript.
R. R. Thomas:A Geometric Buchberger Algorithm for Integer Programming, Technical Report, to appear inMath of Operations Research.
R. Villarreal:Rees Algebras of Edge Ideals, Technical Report, Dept. of Physics and Mathematics, Instituto Politécnico Nacional, México, 1991.
D. R. Woodall: Thrackles and Deadlock, inCombinatorial Mathematics and Its Applications, (D. J. A. Welsh, ed.), Academic Press, New York, 1971, 335–347.
Author information
Authors and Affiliations
Additional information
Research partially supported by a doctoral fellowship of the National University of Mexico, the National Science Foundation, the David and Lucile Packard Foundation and the U.S. Army Research Office (through ACSyAM/MSI, Cornell).
Rights and permissions
About this article
Cite this article
De Loera, J.A., Sturmfels, B. & Thomas, R.R. Gröbner bases and triangulations of the second hypersimplex. Combinatorica 15, 409–424 (1995). https://doi.org/10.1007/BF01299745
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01299745