Hypergraph encodings of arbitrary toric ideals
From MaRDI portal
Publication:2000641
DOI10.1016/J.JCTA.2019.02.017zbMATH Open1416.05200arXiv1711.04354OpenAlexW2963131543MaRDI QIDQ2000641FDOQ2000641
Authors: Sonja Petrović, Apostolos Thoma, Marius Vladoiu
Publication date: 28 June 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Abstract: Relying on the combinatorial classification of toric ideals using their bouquet structure, we focus on toric ideals of hypergraphs and study how they relate to general toric ideals. We show that hypergraphs exhibit a surprisingly general behavior: the toric ideal associated to any general matrix can be encoded by that of a matrix, while preserving the essential combinatorics of the original ideal. We provide two universality results about the unboundedness of degrees of various generating sets: minimal, Graver, universal Gr"obner bases, and indispensable binomials. Finally, we provide a polarization-type operation for arbitrary positively graded toric ideals, which preserves all the combinatorial signatures and the homological properties of the original toric ideal.
Full work available at URL: https://arxiv.org/abs/1711.04354
Recommendations
Cites Work
- Title not available (Why is that?)
- Monomial algebras
- Title not available (Why is that?)
- Minimal generators of toric ideals of graphs
- On the universal Gröbner bases of toric ideals of graphs
- Markov bases of three-way tables are arbitrarily complicated
- Markov complexity of monomial curves
- Toric algebra of hypergraphs
- Combinatorial degree bound for toric ideals of hypergraphs
- Gröbner bases and triangulations of the second hypersimplex
- Robust graph ideals
- Markov bases and generalized Lawrence liftings
- Minimal generating sets of lattice ideals
- Bouquet algebra of toric ideals
- Strongly robust toric ideals in codimension 2
Cited In (12)
- Universally free numerical semigroups
- On robustness and related properties on toric ideals
- On hyper-torre isols
- Toric algebra of hypergraphs
- Combinatorial degree bound for toric ideals of hypergraphs
- Bouquet algebra of toric ideals
- Koszul blowup algebras associated to three-dimensional Ferrers diagrams
- Asymptotic behavior of Markov complexity
- The strongly robust simplicial complex of monomial curves
- On the strongly robust property of toric ideals
- Toric ideals of weighted oriented graphs
- On the relative size of toric bases
Uses Software
This page was built for publication: Hypergraph encodings of arbitrary toric ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000641)