COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS
From MaRDI portal
Publication:2854971
DOI10.1142/S0218196713500331zbMath1273.05237arXiv1206.2512OpenAlexW2129028860MaRDI QIDQ2854971
Elizabeth Gross, Sonja Petrović
Publication date: 24 October 2013
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.2512
Hypergraphs (05C65) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of commutative algebra (05E40)
Related Items
Bouquet algebra of toric ideals ⋮ Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs ⋮ Robust graph ideals ⋮ Neural ideals and stimulus space visualization ⋮ Toric algebra of hypergraphs ⋮ CIO and ring graphs: deficiency and testing ⋮ Hypergraph encodings of arbitrary toric ideals ⋮ On the strongly robust property of toric ideals
Cites Work
- Unnamed Item
- Set-theoretic defining equations of the tangential variety of the Segre variety
- On the universal Gröbner bases of toric ideals of graphs
- Minimal generators of toric ideals of graphs
- A finiteness theorem for Markov bases of hierarchical models
- Indispensable monomials of toric ideals and Markov bases
- Toric ideals generalized by quadratic binomials
- Markov bases of binary graph models
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- Algebraic algorithms for sampling from conditional distributions
- Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
- Binary cumulant varieties
- Markov bases of three-way tables are arbitrarily complicated
- Toric Ideals of Phylogenetic Invariants
- Rees algebras of edge ideals
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
