Robust Graph Ideals

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 charact...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2013-09
Main Authors: Boocher, Adam, Brown, Bryan Christopher, Duff, Timothy, Lyman, Laura, Murayama, Takumi, Nesky, Amy, Schaefer, Karl
Format: Article
Language:English
Subjects:
Graph theory
Rings (mathematics)
Robustness
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422