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

Dimitra Kosta, Apostolos Thoma

Research output: Contribution to journalArticlepeer-review


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 $A^3$ has Markov complexity two or three. Two if the monomial curve is complete intersection and three otherwise. Our main result shows that there is no $d \in N$ such that $m(C) \leq d$ for all monomial curves $C$ in $A^4$. The same result is true even if we restrict to complete intersections. We extend this result to all monomial curves in $A^n$, where $n \geq 4$.
Original languageEnglish
Article number106249
Number of pages12
JournalJournal of pure and applied algebra
Issue number6
Early online date21 Oct 2019
Publication statusPublished - Jun 2020


Dive into the research topics of 'Unboundedness of Markov complexity of monomial curves in A^n for n ≥ 4'. Together they form a unique fingerprint.

Cite this