Graver degrees are not polynomially bounded by true circuit degrees

From MaRDI portal
Publication:2259178

DOI10.1016/J.JPAA.2014.09.021zbMATH Open1333.14049arXiv1306.3305OpenAlexW1964449757MaRDI QIDQ2259178FDOQ2259178


Authors: Christos Tatakis, Apostolos Thoma Edit this on Wikidata


Publication date: 27 February 2015

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

Abstract: Let IA be a toric ideal. We prove that the degrees of the elements of the Graver basis of IA are not polynomially bounded by the true degrees of the circuits of IA.


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




Recommendations




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)