Markov complexity of monomial curves

DOI10.1016/j.jalgebra.2014.06.025zbMath1306.14025arXiv1311.4707OpenAlexW1972687883MaRDI QIDQ404574

Apostolos Thoma, Marius Vladoiu, Hara Charalambous

Publication date: 4 September 2014

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

toric idealsMarkov basisgraver basisLawrence liftings

Mathematics Subject Classification ID

Applications of graph theory (05C90) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Contingency tables (62H17)

Related Items (8)

Bouquet algebra of toric ideals ⋮ Minimal generating sets of lattice ideals ⋮ Generalized robust toric ideals ⋮ The Markov complexity of book graphs ⋮ Asymptotic behavior of Markov complexity ⋮ Hypergraph encodings of arbitrary toric ideals ⋮ Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) ⋮ On the strongly robust property of toric ideals

Uses Software

• 4ti2

Cites Work

• Markov bases in algebraic statistics.
• Minimal generators of toric ideals of graphs
• A finiteness theorem for Markov bases of hierarchical models
• Lectures on algebraic statistics
• Higher Lawrence configurations.
• Algebraic algorithms for sampling from conditional distributions
• Generators and relations of abelian semigroups and semigroup rings
• Generic lattice ideals
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• Minimal systems of binomial generators and the indispensable complex of a toric ideal

This page was built for publication: Markov complexity of monomial curves