Lower bounds on the graver complexity of \(M\)-fold matrices

DOI10.1007/s00026-015-0297-2zbMath1357.15019arXiv1311.3853OpenAlexW2964267345MaRDI QIDQ259721

Raymond Hemmecke, Elisabeth Finhold

Publication date: 18 March 2016

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.3853

zbMATH Keywords

lower boundinteger matrix\(M\)-fold matrixGraver basisGraver complexity

Mathematics Subject Classification ID

Integer programming (90C10) Matrices of integers (15B36) Vector spaces, linear dependence, rank, lineability (15A03) Combinatorial complexity of geometric structures (52C45)

Related Items

The Markov complexity of book graphs ⋮ Unnamed Item ⋮ Asymptotic behavior of Markov complexity ⋮ Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) ⋮ Unnamed Item

Cites Work

• Unnamed Item
• A polynomial oracle-time algorithm for convex integer minimization
• The Graver complexity of integer programming
• Optimality criterion for a class of nonlinear integer programs.
• On the Graver complexity of codimension \(2\) matrices
• A finiteness theorem for Markov bases of hierarchical models
• \(N\)-fold integer programming
• On the Gröbner complexity of matrices
• Higher Lawrence configurations.
• A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
• On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
• On the foundations of linear and integer linear programming I
• Universal Gröbner Bases of Colored Partition Identities