On the Gröbner complexity of matrices

DOI10.1016/j.jpaa.2008.11.044zbMath1168.13018arXiv0708.4392OpenAlexW2163737662MaRDI QIDQ1017673

Raymond Hemmecke, Kristen A. Nairn

Publication date: 12 May 2009

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

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

zbMATH Keywords

Gröbner basesGraver basesGröbner complexity

Mathematics Subject Classification ID

Integer programming (90C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (5)

Generalized robust toric ideals ⋮ Markov bases and generalized Lawrence liftings ⋮ The Graver complexity of integer programming ⋮ Universal Gröbner Bases of Colored Partition Identities ⋮ Lower bounds on the graver complexity of \(M\)-fold matrices

Uses Software

• 4ti2

Cites Work

• A finiteness theorem for Markov bases of hierarchical models
• Variation of cost functions in integer programming
• Higher Lawrence configurations.
• On the positive sums property and the computation of Graver test sets
• Lexicographic Gröbner bases for transportation problems of format \(r\times 3\times 3\)
• On the foundations of linear and integer linear programming I
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals

This page was built for publication: On the Gröbner complexity of matrices