On the Graver complexity of codimension 2 matrices

MaRDI QIDQ839711zbMATH OpenFDO

Authors Kristen A. Nairn

Publication date 2 September 2009

Published in Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/227934, http://www.emis.de/journals/BAG/vol.50/no.2/16.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Graver complexitymonomial curvesHilbert bases

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects and applications of commutative rings (13P99)

Recommendations

• Lower bounds on the graver complexity of M-fold matrices
• On the universal Gröbner bases of varieties of minimal degree
• On the Gröbner complexity of matrices
• The Graver complexity of integer programming
• A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph

Cited in

(6)

• Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)
• On the Gröbner complexity of matrices
• Asymptotic behavior of Markov complexity
• On the complexity of the ℰ2 Grzegorczyk class
• The Graver complexity of integer programming
• Lower bounds on the graver complexity of \(M\)-fold matrices

This page was built for publication: On the Graver complexity of codimension \(2\) matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839711)