Hypergraph encodings of arbitrary toric ideals

DOI10.1016/J.JCTA.2019.02.017MaRDI QIDQ2000641zbMATH OpenOpenAlexFDO

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)

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

zbMATH Keywords

Graver basishypergraphsminimal generating setstoric idealsresolutionsuniversal Gröbner basis

Mathematics Subject Classification ID

Hypergraphs (05C65)

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 $0/1$ 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.

Recommendations

• Combinatorial degree bound for toric ideals of hypergraphs
• Bouquet algebra of toric ideals
• Toric ideals of flow polytopes
• Minimal generators of toric ideals of graphs
• Short rational functions for toric algebra and applications

Cites work

• scientific article; zbMATH DE number 1324671 (Why is no real title available?)
• scientific article; zbMATH DE number 2190625 (Why is no real title available?)
• Bouquet algebra of toric ideals
• Combinatorial degree bound for toric ideals of hypergraphs
• Gröbner bases and triangulations of the second hypersimplex
• Markov bases and generalized Lawrence liftings
• Markov bases of three-way tables are arbitrarily complicated
• Markov complexity of monomial curves
• Minimal generating sets of lattice ideals
• Minimal generators of toric ideals of graphs
• Monomial algebras
• On the universal Gröbner bases of toric ideals of graphs
• Robust graph ideals
• Strongly robust toric ideals in codimension 2
• Toric algebra of hypergraphs

Cited in

(12)

• Universally free numerical semigroups
• On robustness and related properties on toric ideals
• Toric algebra of hypergraphs
• On hyper-torre isols
• 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

Describes a project that uses

Uses Software

• 4ti2

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)