The scaling-limit conjecture for critical Fortuin–Kasteleyn planar maps
Let planar maps denote the critical Fortuin–Kasteleyn planar maps with parameter , and let be a parameter in satisfying
Scaling-limit conjecture. When , the -FK planar map converges in the scaling limit to a -Liouville quantum gravity surface. When , it converges in the scaling limit to the continuum random tree.
References
- Yuyang Feng, “Triviality of critical Fortuin-Kasteleyn decorated planar maps for q>4”, arXiv:2311.06235 (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 7
Claimed by OpenAI. For critical spherical FK-Ising maps (q=2), the manuscript claims stationary all-edge random walks converge jointly with the measured metric space to Liouville Brownian motion on the unit-area gamma=sqrt(3) LQG sphere. It retains loops and multiplicities, starts from degree/(2n), and accelerates time by n. This is a finite spherical, dynamical companion to the page’s scaling-limit question, not an all-q or infinite-volume assertion.See full solution
Claimed by OpenAI. For critical spherical FK-Ising maps (q=2), the manuscript claims joint metric-measure, eigenvalue and heat-trace convergence to the unit-area gamma=sqrt(3) LQG sphere with Liouville Brownian motion. The stationary all-edge walk has degree/(2n) measure, total attempt rate one, and time/spectrum scaling n. This is a finite spherical spectral companion; other q values and infinite-volume limits are not claimed here.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-211-02-Spectral-convergence-for-critical-FK-Ising-planar-maps.pdfOpen
Claimed by OpenAI. For finite rooted planar maps weighted by their NUMBER of spanning trees, the manuscript claims stationary all-edge walks converge jointly with measured metric spaces to Liouville Brownian motion on the unit-area gamma=sqrt(2) LQG sphere. Time is accelerated by n and the stationary measure is degree/(2n). This is a related spanning-tree model at the boundary parameter; it does not identify it with the page’s literal q=0 FK law.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-211-03-A-Linear-Clock-for-Random-Walk-on-Tree-Weighted-Planar-Maps.pdfOpen
Claimed by OpenAI. For every fixed 0<q<4, the manuscript claims critical spherical FK planar maps in flag-triangle uniformization converge jointly to the corresponding unit-area LQG sphere and an independent conformal loop ensemble. This addresses the finite spherical conformal case of the page’s scaling-limit question. Endpoint q=0 or q=4, other topologies, and infinite-volume maps are not asserted in this manuscript.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-211-04-Canonical-conformal-limits-of-subcritical-FK-planar-maps.pdfOpen
Claimed by OpenAI. At q=4, the manuscript claims spherical FK maps in equilateral flag uniformization converge jointly to a unit-area critical gamma=2 Liouville quantum sphere with intrinsic metric and independent nested CLE_4. The critical sphere is constructed as a subcritical limit. This addresses the page’s finite spherical endpoint prediction; its displayed gamma interval excludes 2, so that interval is not the endpoint convention used here.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-211-05-The-critical-Liouville-quantum-sphere-and-geometric-limits-of-FK-maps-at-q-4.pdfOpen
Claimed by OpenAI. For every fixed 0<q<4 and for spanning-tree-decorated finite spherical maps, the manuscript claims deterministically rescaled graph distances with degree-normalized vertex measure converge in Gromov–Hausdorff–Prokhorov law to ordinary unit-area LQG spheres. This gives a finite spherical graph-metric version of the page’s scaling-limit prediction. It does not assert endpoint q=4 or infinite-volume convergence.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-211-06-Metric-measure-limits-of-subcritical-FK-and-spanning-tree-planar-maps.pdfOpen
Claimed by OpenAI. For every fixed q>4, the manuscript claims critical n-edge spherical FK planar maps, with graph distances scaled by c(q)*n^(-1/2) and degree-normalized vertex measure, converge in Gromov–Hausdorff–Prokhorov law to the Brownian continuum random tree. This addresses the finite spherical form of the page’s q>4 prediction. The q=4 endpoint and infinite-volume regimes are not covered by this manuscript.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-211-07-Brownian-continuum-random-tree-limits-of-finite-Fortuin-Kasteleyn-maps-above-four.pdfOpen