Markov complexity of monomial curves

DOI10.1016/J.JALGEBRA.2014.06.025MaRDI QIDQ404574zbMATHOpenAlexFDO

Authors Hara Charalambous, Apostolos Thoma, Marius Vladoiu

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

Markov basisgraver basistoric idealsLawrence liftings

Mathematics Subject Classification ID

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

Abstract: Let $$. We give an algebraic characterization of the universal Markov basis of the toric ideal $I_{mathcalA}$. We show that the Markov complexity of $mathcalA=n_1,n_2,n_3$ is equal to two if $I_{mathcalA}$ is complete intersection and equal to three otherwise, answering a question posed by Santos and Sturmfels. We prove that for any $rgeq2$ there is a unique minimal Markov basis of $mathcal{A}^{(r)}$. Moreover, we prove that for any integer $l$ there exist integers $n_1,n_2,n_3$ such that the Graver complexity of $mathcalA$ is greater than $l$.

Recommendations

• Markov bases and generalized Lawrence liftings
• Computing generating sets of lattice ideals and Markov bases of lattices
• Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)
• Markov bases of toric ideals: connecting commutative algebra and statistics
• Indispensable monomials of toric ideals and Markov bases

Cites work

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

Cited in

(12)

• Hypergraph encodings of arbitrary toric ideals
• Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)
• Generalized robust toric ideals
• Markov bases and generalized Lawrence liftings
• Bouquet algebra of toric ideals
• The strongly robust simplicial complex of monomial curves
• The Markov complexity of book graphs
• Asymptotic behavior of Markov complexity
• On the strongly robust property of toric ideals
• Minimal generating sets of lattice ideals
• Indispensable monomials of toric ideals and Markov bases
• Markov bases of toric ideals: connecting commutative algebra and statistics

Describes a project that uses

Uses Software

• 4ti2

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

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