← All problems

Angel–Gorin–Holroyd–Romik–Virág conjecture on random reduced words

11 years old · traced to

Let w0=[n,n−1,…,1]∈Snw_0=[n,n-1,\ldots,1]\in S_n be the longest permutation, let pp be its inversion number, and choose a reduced word (a1,…,ap)(a_1,\ldots,a_p) uniformly at random. Form the initial product sa1sa2⋯sa⌊p/2⌋s_{a_1}s_{a_2}\cdots s_{a_{\lfloor p/2\rfloor}} and consider the locations of the 11's in its permutation matrix. Random reduced-word limit-shape conjecture. As nn tends to infinity, the probability distribution of these 11's approaches the surface measure of the sphere projected to two dimensions.

References

Status

  • Solved: Duncan Dauvergne and Bálint Virág. The Archimedean limit of random sorting networks (Journal of the American Mathematical Society, 2022) https://doi.org/10.1090/jams/993

Source: Sara C. Billey and Peter R. W. McNamara, “The contributions of Stanley to the fabric of symmetric and quasisymmetric functions”, arXiv:1505.01115 (2015).

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.