Higher Lawrence configurations.
From MaRDI portal
Publication:1399915
DOI10.1016/S0097-3165(03)00092-XzbMath1036.52018arXivmath/0209326OpenAlexW2025336071MaRDI QIDQ1399915
Bernd Sturmfels, Francisco Santos
Publication date: 30 July 2003
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0209326
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Inference from stochastic processes (62M99) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Markov chain Monte Carlo test of toric homogeneous Markov chains, Normal Binary Hierarchical Models, Huge Unimodular $n$-Fold Programs, On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, A finiteness theorem for Markov bases of hierarchical models, Minimal generating sets of lattice ideals, Algebraic factor analysis: tetrads, pentads and beyond, The quadratic Graver cone, quadratic integer minimization, and extensions, Theorems of Carathéodory, Minkowski–Weyl, and Gordan up to Symmetry, Markov bases and generalized Lawrence liftings, Markov complexity of monomial curves, The Markov complexity of book graphs, \(n\)-fold integer programming in cubic time, \(N\)-fold integer programming and nonlinear multi-transshipment, Asymptotic behavior of Markov complexity, Finite Gröbner bases in infinite dimensional polynomial rings and applications, Convex integer optimization by constantly many linear counterparts, The Graver complexity of integer programming, Markov bases of three-way tables are arbitrarily complicated, Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models, Lexicographic Gröbner bases for transportation problems of format \(r\times 3\times 3\), Universal Gröbner Bases of Colored Partition Identities, \(N\)-fold integer programming, Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\), On the Gröbner complexity of matrices, Convex integer maximization via Graver bases, A Kruskal-Katona type result and applications, Rapid Mixing and Markov Bases, Huge multiway table problems, Lower bounds on the graver complexity of \(M\)-fold matrices
Cites Work
