Unboundedness of Markov complexity of monomial curves in A^n for n 4

DOI10.1016/J.JPAA.2019.106249zbMATH Open1431.13031arXiv1809.09932OpenAlexW2981645150MaRDI QIDQ2301979FDOQ2301979

Authors: Dimitra Kosta, Apostolos Thoma 

Publication date: 25 February 2020

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Abstract: Computing the complexity of Markov bases is an extremely challenging problem; no formula is known in general and there are very few classes of toric ideals for which the Markov complexity has been computed. A monomial curve $C$ in $mathbb{A}^3$ has Markov complexity $m(C)$ two or three. Two if the monomial curve is complete intersection and three otherwise. Our main result shows that there is no $dinmathbbN$ such that $m(C)leqd$ for all monomial curves $C$ in $mathbb{A}^4$. The same result is true even if we restrict to complete intersections. We extend this result to all monomial curves in $mathbb{A}^n,ngeq4$.

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

Recommendations

• Markov complexity of monomial curves
• On the Graver complexity of codimension \(2\) matrices
• On the regularity of certain projective monomial curves
• A finiteness theorem for Markov bases of hierarchical models
• Set-theoretic complete intersection monomial curves in affine four space

zbMATH Keywords

Markov basismonomial curvestoric idealsLawrence liftings

Mathematics Subject Classification ID

Applications of graph theory (05C90) Contingency tables (62H17) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Commutative rings defined by binomial ideals, toric rings, etc. (13F65)

Cites Work

• Lectures on algebraic statistics
• Higher Lawrence configurations.
• A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
• Lower bounds on the graver complexity of \(M\)-fold matrices
• The Graver complexity of integer programming
• A finiteness theorem for Markov bases of hierarchical models
• \(N\)-fold integer programming
• Algebraic algorithms for sampling from conditional distributions
• Nonlinear discrete optimization. An algorithmic theory
• Generic lattice ideals
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• Markov bases of three-way tables are arbitrarily complicated
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• Markov complexity of monomial curves
• Markov bases and generalized Lawrence liftings

Cited In (3)

• Markov complexity of monomial curves
• Asymptotic behavior of Markov complexity
• The Markov complexity of book graphs

Uses Software

• 4ti2

This page was built for publication: Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\)

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