Largest-loop exponent conjecture for uniform meandric systems
Let be a uniform meandric system of size , and order its loops by decreasing size. For each fixed , let the th largest loop be measured by its number of vertices. Largest-loop exponent conjecture. With probability tending to as ,
This is a KPZ-based prediction for the macroscopic loop sizes in uniform meandric systems and remains unproved.
References
- Jacopo Borga, Ewain Gwynne and Minjae Park, “On the geometry of uniform meandric systems”, arXiv:2212.00534 (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.