REVIEW 4 cited by
Exact Solution of the O(n) Model on a Random Lattice
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Exact Solution of the O(n) Model on a Random Lattice
abstract
We present an exact solution of the $O(n)$ model on a random lattice. The coupling constant space of our model is parametrized in terms of a set of moment variables and the same type of universality with respect to the potential as observed for the one-matrix model is found. In addition we find a large degree of universality with respect to $n$; namely for $n\in ]-2,2[$ the solution can be presented in a form which is valid not only for any potential, but also for any $n$ (not necessarily rational). The cases $n=\pm 2$ are treated separately. We give explicit expressions for the genus zero contribution to the one- and two-loop correlators as well as for the genus one contribution to the one-loop correlator and the free energy. It is shown how one can obtain from these results any multi-loop correlator and the free energy to any genus and the structure of the higher genera contributions is described. Furthermore we describe how the calculation of the higher genera contributions can be pursued in the scaling limit.
Forward citations
Cited by 4 Pith papers
-
A bijective topological recursion for maps
Iterating Tutte's edge-erasing procedure until the topology changes yields a bijective pair-of-pants excision that reproduces (blobbed) topological recursion for maps and stuffed maps.
-
A bijective topological recursion for maps
A bijective skinning procedure yields the topological recursion for maps of arbitrary topology at the level of formal generating series, with no analyticity assumptions, including stuffed maps and a combinatorial recu...
-
Depth profile of depth-weighted trees with bounded weights
Under bounded weights satisfying Sn/n oℓ, the depth profile of depth-weighted recursive trees admits an Edgeworth-type scaling limit involving a random analytic function, and depth is a.s. asymptotic to e log n.
-
(Un)solvable Matrix Models for BPS Correlators
Proposes complex matrix models for BPS correlators in N=4 SYM, relating eigenvalue distributions to LLM droplet shapes and enabling computations of one-point functions and three-point correlators via reductions to kno...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.