Cut ideals of K₄-minor free graphs are generated by quadrics

DOI10.1307/MMJ/1320763056zbMATH Open1234.14036arXiv0805.1762OpenAlexW1996471058MaRDI QIDQ654935FDOQ654935

Authors: Alexander Engström 

Publication date: 28 December 2011

Published in: Michigan Mathematical Journal (Search for Journal in Brave)

Abstract: Cut ideals are used in algebraic statistics to study statistical models defined by graphs. Intuitively, topological restrictions on the graphs should imply structural statements about the corresponding cut ideals. Several theorems and many computer calculations support that. Sturmfels and Sullivant conjectured that the cut ideal is generated by quadrics if and only if the graph is free of K4-minors. Parts of the conjecture has been resolved by Brennan and Chen, and later by Nagel and Petrovic. We prove the full conjecture by introducing a new type of toric fiber product theorem.

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

Recommendations

• Strong Koszulness of the toric ring associated to a cut ideal
• Toric geometry of series-parallel graphs
• Properties of cut ideals associated to ring graphs
• Monomial cut ideals
• The toric ideal of a graphic matroid is generated by quadrics

zbMATH Keywords

cut ideals\(K_{4}\)-minor free graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Cites Work

• Title not available (Why is that?)
• Algebraic Statistics for Computational Biology
• Lectures on algebraic statistics
• Title not available (Why is that?)
• Geometry of cuts and metrics
• Algebraic algorithms for sampling from conditional distributions
• Toric fiber products
• Properties of cut ideals associated to ring graphs
• Toric geometry of cuts and splits
• Markov bases of binary graph models
• Multigraded commutative algebra of graph decompositions
• Toric geometry of series-parallel graphs
• A note on standard systems and ultrafilters

Cited In (17)

• Markov chain Monte Carlo methods for the regular two-level fractional factorial designs and cut ideals
• Toric geometry of series-parallel graphs
• The $h^{*}$-polynomial of the cut polytope of $K_{2,m}$ in the lattice spanned by its vertices
• Lexicographic and reverse lexicographic quadratic Gröbner bases of cut ideals
• Multigraded commutative algebra of graph decompositions
• Cycle algebras and polytopes of matroids
• Normality of cut polytopes of graphs is a minor closed property
• The three-state toric homogeneous Markov chain model has Markov degree two
• A Note on Seminormality of Cut Polytopes
• Classes of cut ideals and their Betti numbers
• Retracts and algebraic properties of cut algebras
• A Gröbner basis characterization for chordal comparability graphs
• Monomial cut ideals
• Title not available (Why is that?)
• Ideals of graph homomorphisms
• Seminormality, canonical modules, and regularity of cut polytopes
• Gorenstein cut polytopes

This page was built for publication: Cut ideals of \(K_{4}\)-minor free graphs are generated by quadrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654935)