Four-point map-counting lower-bound conjecture
Four-point map-counting lower-bound conjecture
Let be the set of maps with the specified vertex data, and order signatures componentwise: when for some . Let denote the maps whose signature is at least , and let be the weakly connected maps. Four-point map-counting lower-bound conjecture. For any and , one has
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.
Sources & referencesView supporting material
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.