Higher Lawrence configurations

Abstract

Any configuration of lattice vectors gives rise to a hierarchy of higher-dimensional configurations which generalize the Lawrence construction in geometric combinatorics. We prove finiteness results for the Markov bases, Graver bases and face posets of these configurations, and we discuss applications to the statistical theory of log-linear models.

12 pages. Changes from v1 and v2: minor edits. This version is to appear in the Journal of Combinatorial Theory, Ser. A

References in corpus (1)

• Lectures on 0/1-polytopes

Cited by in corpus (16)

• Nonlinear Integer Programming
• Algebraic Factor Analysis: Tetrads, Pentads and Beyond
• On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond
• Castelnuovo-Mumford regularity up to symmetry
• A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs
• Codimension and Projective Dimension up to Symmetry
• Minimal Generating Sets of Lattice Ideals
• Markov chain Monte Carlo test of toric homogeneous Markov chains
• Theorems of Carathéodory, Minkowski-Weyl, and Gordan up to symmetry
• Nash-equilibria and N-fold integer programming
• A Kruskal-Katona type result and applications
• Asymptotic behavior of symmetric ideals: A brief survey
• Unboundedness of Markov complexity of monomial curves in ${\mathbb{A}}^n$ for $n\ge 4$
• Lawrence Lifts, Matroids, and Maximum Likelihood Degrees
• The Huge Multiway Table Problem
• The norm of the saturation of a binomial ideal, and applications to Markov bases