Four-point map-counting lower-bound conjecture

At least 2 years old · documented by

Let M0,4(r1,r2,r3,r4)\mathcal{M}_{0,4}(r_1,r_2,r_3,r_4) be the set of maps with the specified vertex data, and order signatures componentwise: σotgreaterthanorequaltoσ′\sigma ot greater than or equal to\sigma' when σxotgreaterthanorequaltoσx′\sigma_x ot greater than or equal to\sigma'_x for some xotins,t,ux otin{ s,t,u}. Let M0,4(r1,r2,r3,r4∣σs,σt,σu)\mathcal{M}_{0,4}(r_1,r_2,r_3,r_4\mid\sigma_s,\sigma_t,\sigma_u) denote the maps whose signature is at least σ=(σs,σt,σu)\sigma=(\sigma_s,\sigma_t,\sigma_u), and let M0,4c(r1,r2,r3,r4)\mathcal{M}^c_{0,4}(r_1,r_2,r_3,r_4) be the weakly connected maps. Four-point map-counting lower-bound conjecture. For any r1,r2,r3,r4r_1,r_2,r_3,r_4 and σotgreaterthanorequalto(12,12,12)\sigma ot greater than or equal to(\frac12,\frac12,\frac12), one has

∣M0,4(r1,r2,r3,r4∣σ)∣≥∣M0,4c(r1,r2,r3,r4)∣−∑x∈{s,t,u}⌊(σx−12)2⌋.\left|\mathcal{M}_{0,4}(r_1,r_2,r_3,r_4\mid\sigma)\right| \geq \left|\mathcal{M}^c_{0,4}(r_1,r_2,r_3,r_4)\right| - \sum_{x\in\{s,t,u\}} \left\lfloor \left(\sigma_x -\tfrac12\right)^2\right\rfloor.

The claim is presented as a lower bound motivated by the conformal-bootstrap interpretation of sets of maps with a minimum signature; its resolution is not specified in the supplied text.

References

Primary source

Linnea Grans-Samuelsson, Jesper Lykke Jacobsen, Rongvoram Nivesvivat, Sylvain Ribault and Hubert Saleur, “From combinatorial maps to correlation functions in loop models”, arXiv:2302.08168 (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.