Graver degrees are not polynomially bounded by true circuit degrees
DOI10.1016/J.JPAA.2014.09.021zbMATH Open1333.14049arXiv1306.3305OpenAlexW1964449757MaRDI QIDQ2259178FDOQ2259178
Authors: Christos Tatakis, Apostolos Thoma
Publication date: 27 February 2015
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.3305
Recommendations
- A degree bound for the Graver basis of non-saturated lattices
- Degree 2 Boolean functions on Grassmann graphs
- scientific article; zbMATH DE number 4087710
- Degrees which do not bound minimal degrees
- Some degree bounds for the circumference of graphs
- Graded Betti numbers of some families of circulant graphs
- On the graceful polynomials of a graph
- scientific article; zbMATH DE number 3859168
- Bounds for the degrees in the Nullstellensatz
- Nontriviality of the \(M\)-degree of the \(A\)-polynomial
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]toric idealGraver basis
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)
Cites Work
Cited In (4)
This page was built for publication: Graver degrees are not polynomially bounded by true circuit degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259178)