Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the Graver complexity of codimension \(2\) matrices

From MaRDI portal
Publication:839711
Jump to:navigation, search

zbMath1195.14067MaRDI QIDQ839711

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


zbMATH Keywords

Graver complexitymonomial curvesHilbert bases


Mathematics Subject Classification ID

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


Related Items (1)

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




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:839711&oldid=12780520"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 14:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki