Robust Graph Ideals
Robust Graph Ideals
复制标题
稳健的图理想
DOI:
10.1007/s00026-015-0288-3
复制
发表时间:
2015
影响因子:
0.5
通讯作者:
Boocher A
中科院分区:
文献类型:
--
作者:
Boocher A
LetIbe a toric ideal. We sayIisrobustif its universal Gröbner basis is a minimal generating set. We show that any robust toric ideal arising from a graphGis 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 ofG.
登录
查看更多内容
影响因子:
0.7
作者:
Adam Boocher;Elina Robeva
通讯作者:
Elina Robeva
影响因子:
1.1
作者:
E. Reyes;Christos Tatakis;Apostolos Thoma
通讯作者:
Apostolos Thoma
影响因子:
0.8
作者:
Elizabeth Gross;Sonja Petrović
通讯作者:
Sonja Petrović
DOI:
--
发表时间:
2010
期刊:
Journal of Combinatorial Theory
影响因子:
--
作者:
Christos Tatakis;Apostolos Thoma
通讯作者:
Apostolos Thoma
DOI:
--
发表时间:
2011
期刊:
影响因子:
--
作者:
Adam Boocher
通讯作者:
Adam Boocher