Markov complexity of monomial curves

Abstract: Let

. We give an algebraic characterization of the universal Markov basis of the toric ideal

I_{m a t h c a l A}

. We show that the Markov complexity of

m a t h c a l A = n_{1}, n_{2}, n_{3}

is equal to two if

I_{m a t h c a l A}

is complete intersection and equal to three otherwise, answering a question posed by Santos and Sturmfels. We prove that for any

r g e q 2

there is a unique minimal Markov basis of

m a t h c a l 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

m a t h c a l A

is greater than

l

.

Recommendations

Cites Work

Cited In (9)

Uses Software

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