The braid-class ratio conjecture for reduced words

Let d53ed53e be the symmetric group on nn letters. For d70eid53ed70e i d53e, let d4a1(d70e)d4a1(d70e) be the set of reduced words of d70ed70e and let d49e(d70e)d49e(d70e) be the set of braid classes of reduced words. The braid-class ratio conjecture. For all d70eid53ed70e i d53e,

12R(σ)B(σ)R(σ).\dfrac{1}{2} |\mathcal{R}(\sigma)| \leq |\mathcal{B}(\sigma)|\leq |\mathcal{R}(\sigma)|.

The conjecture was motivated by computations for n=4,5,6,7,8n=4,5,6,7,8 and concerns the proportion of reduced words identified by braid moves; its status is not resolved in the supplied text.

Sources & referencesView supporting material

Primary source

Jennifer Elder, “On Graphs of Sets of Reduced Words”, arXiv:2201.12887 (2023).

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.