Analyticity of the planar limit of a matrix model
Stavros Garoufalidis, Ionel Popescu

TL;DR
This paper develops a new formula for the analytic planar limit of a matrix model with a one-cut potential, demonstrating its analyticity in infinitely many variables and applying it to combinatorial enumeration problems.
Contribution
It introduces a Chebyshev polynomial-based method to explicitly compute the planar limit and proves its analyticity for a broad class of potentials, including those with infinitely many variables.
Findings
Derived a new explicit formula for the planar limit using Chebyshev polynomials.
Proved the analyticity of the planar limit in infinitely many variables for certain potentials.
Applied the method to specific potentials, confirming conjectures about their analytic properties.
Abstract
Using Chebyshev polynomials combined with some mild combinatorics, we provide a new formula for the analytical planar limit of a random matrix model with a one-cut potential . For potentials , as a power series in all , the formal Taylor expansion of the analytic planar limit is exactly the formal planar limit. In the case is analytic in infinitely many variables (on the appropriate spaces), the planar limit is also an analytic function in infinitely many variables and we give quantitative versions of where this is defined. Particularly useful in enumerative combinatorics are the gradings of , and . The associated planar limits as functions of count planar diagram sorted by the number of edges…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
