Markov complexity of monomial curves

DOI10.1016/J.JALGEBRA.2014.06.025MaRDI QIDQ404574zbMATH OpenOpenAlexFDO

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

graver basisLawrence liftingsMarkov basistoric ideals

Mathematics Subject Classification ID

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

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$.

Review text

Let \(A:=\{{\mathbf a_1},\dots, {\mathbf a_n}\}\subset {\mathbb N}^m \). This paper concerns the study of the Markov basis of a toric ideal \(I_A\) associated to \(A\). A minimal Markov basis of the toric ideal \(I_A\), is a set of vectors \({\mathbf u_1},\dots,{\mathbf u_s}\in {\mathbb Z}^n\) such that \({\mathbf x}^{{\mathbf u_1}^+}-{\mathbf x}^{{\mathbf u_1}^-}, ,\dots, {\mathbf x}^{{\mathbf u_s}^+}-{\mathbf x}^{{\mathbf u_s}^-}\) is a minimal basis of the ideal \(I_A\), where \({\mathbf u_i}={\mathbf u_i}^+-{\mathbf u_i}^-\), both \({\mathbf u_i}^+,{\mathbf u_i}^-\) have non-negative components. The universal Markov basis of \(I_A\) is the union of all minimal Markov basis of \(I_A\). The first result in this paper is an algebraic characterization of the universal Markov basis of \(I_A\). The second result consists in the study of Markov basis for the toric ideal \(I_A^{((r))}\) associated to the \(r\)-Lawrence lift of \(A\) in the case of an affine monomial curve in \(K^3\). Recall that the Markov basis of a codimension two simplicial toric variety is well-known, but study Markov basis for the toric ideal \(I_A^{((r))}\) is a difficult problem.

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

(15)

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

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)