The maximal braid-edge density conjecture for layered permutations
Statement
Let be the symmetric group on letters, and let denote the family of permutations specified in the paper. For , let be the graph of reduced words, with vertices corresponding to reduced words and braid edges corresponding to braid moves. The maximal braid-edge density conjecture. For all , if for some , then has the highest proportion of braid edges to vertices among all graphs of in . The claim is a proposed second route toward the paper's main theorem and is not resolved in the supplied text.
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.