(iii) I conjecture that cyclic labelings correspond to reduced words for the full twist in the squares of the Birman-Ko-Lee generators of the braid group.
Statement
(iii) I conjecture that cyclic labelings correspond to reduced words for the full twist in the squares of the Birman-Ko-Lee generators of the braid group. (iv) There are local moves that preserve the property of being a cyclic labeling: (a) disjoint edges with consecutive labels commute (as edge lists, we have the sequence (ij)(kl) = (kl)(ij) when it isn’t the case that i < k < j < l cyclically); (b) triangles whose edges have consecutive labels can be rotated (that is, (ij)(jk)(ik) = (ik)(ij)(jk) = (jk)(ik)(ij) when i < j < k cyclically). (c) a “pierced triangle” has the move (ij)(jl)(jk)(ik) = (ik)(ij)(jl)(jk) when i < j < k < l cyclically. The report passage is retained verbatim as the relevant context for this extracted problem.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.