Markov width conjecture for cycles

Let CC be a cycle of length nn, with edges 12,23,,n112, 23, \ldots, n1. For a vertex ii, let did_i denote its associated model parameter, and let μ(C,d)\mu(C,d) be the Markov width of the cycle model. The indices below are considered cyclically modulo nn. Markov width conjecture for cycles. The Markov width satisfies

μ(C,d)=maxi=1,,nμ(K3,(di,di+1,di+2)).\mu(C,d)=\max_{i=1,\ldots,n}\mu(K_3,(d_i,d_{i+1},d_{i+2})).

Repeated toric fiber products of cycles reduce computations of Markov width to the three-cycle, which motivates this conjectural reduction; the supplied source does not establish the equality in general.

Sources & referencesView supporting material

Primary source

Alexander Engstrom, Thomas Kahle and Seth Sullivant, “Multigraded Commutative Algebra of Graph Decompositions”, arXiv:1102.2601 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.