ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d53ed53e be the symmetric group on nn letters, and let w0(k,i)w_0^{(k,i)} denote the family of permutations specified in the paper. For d70eid53ed70e i d53e, let G(d70e)G(d70e) 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 d70eid53ed70e i d53e, if d70e=w0(k,i)d70e=w_0^{(k,i)} for some k,iiad53ck,i i ad53c, then G(d70e)G(d70e) has the highest proportion of braid edges to vertices among all graphs of d4a1(d70e)d4a1(d70e) in d53ed53e. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.