Robust graph ideals

From MaRDI portal
Publication:891950

DOI10.1007/S00026-015-0288-3zbMATH Open1365.13042arXiv1309.7630OpenAlexW2963750838MaRDI QIDQ891950FDOQ891950


Authors: Adam Boocher, Bryan Christopher Brown, Timothy Duff, Laura Lyman, Takumi Murayama, Amy Nesky, Karl Schaefer Edit this on Wikidata


Publication date: 18 November 2015

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: Let I be a toric ideal. We say I is robust if its universal Groebner basis is a minimal generating set. We show that any robust toric ideal arising from a graph G is also minimally generated by its Graver basis. We then completely characterize all graphs which give rise to robust ideals. Our characterization shows that robustness can be determined solely in terms of graph-theoretic conditions on the set of circuits of G.


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




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Robust graph ideals

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