Pith. sign in

REVIEW 3 major objections 4 minor 67 references

Universal Asymptotics and Exact Enumeration of Eulerian Maps

T0 review · 3 major / 4 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read One generating-function singularity governs the asymptotic count of all mixed-valence Eulerian maps, for every fixed genus.

desk verdict First mixed-valence Eulerian map asymptotics for genus ≥ 1, credible and worth refereeing, but the displayed genus-1 formula has a small well-posedness bug and a couple of proof details need tightening. read the letter →

arxiv 2607.14342 v1 pith:XA744J77 submitted 2026-07-15 math.CO math-phmath.CVmath.MP

Ahmad Barhoumi , Roozbeh Gharakhloo , Nathan Hayford This is my paper · ORCID
classification math.COmath-phmath.CVmath.MP MSC 05C3005A1505A1660B2042C05
keywords EulerianmapsmapenumerationmixedvalenceasymptoticuniversalityrandommatrixmodelsorthogonalpolynomialsPainlevéI
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper aims to settle the leading-order enumeration of connected, labeled Eulerian maps whose vertices may have many different even degrees. It claims that once the proportions of vertices of each degree are fixed, the count grows as a universal power of V times V! times an exponential factor, with a prefactor that depends on the degree mixture only through two numbers: the limiting average degree and the limiting sum of squared degrees. The genus-dependent prefactor constants obey the same nonlinear recurrence that produces Painlevé I coefficients. If this is right, it closes a previously open problem for mixed-valence maps of positive genus and also delivers an exact closed-form count for genus one.

What carries the argument

The central object is the algebraic curve P(σ;t)=κ that defines the equilibrium-measure endpoint σ(t) for a Hermitian matrix model with even potential. The recurrence coefficients r_g(t) of the associated orthogonal polynomials are shown to be rational in σ and derivatives of P, and near the critical surface they have the singular form r_g(t) = C_g ξ(t)^{-(5g-1)/2}(a_g(t)+b_g(t)ξ(t)^{1/2}), where ξ is the discriminant of P as a polynomial in σ. The critical surface is parameterized by the vertex-degree proportions α, with t(α) the unique minimal point; near it, σ behaves like a(t)+b(t)ξ^{1/2}, and the Hessian determinant of the exponential tilt has an explicit closed form. This discriminant

What would settle it

Take a degree mixture with vertices of degrees 4 and 6 only, compute the first few coefficients of the genus-one generating function A_1(t), and check that none are negative and that the discriminant surface has no second minimal point with the same coordinate-wise absolute values as t(α); a negative coefficient or a competing minimal point would break the saddle-point derivation.

Watch

Extended reading notes

Core claim

Theorem 1 asserts that for fixed genus g and fixed positive proportions α of vertices of even degrees 2,4,...,2p, the number N_g(⌊αV⌋) of connected, labeled Eulerian maps is K_g / Γ((5g-1)/2) · V^{(5g-7)/2} · V! · e^{VΩ(α)} (1+O(V^{-1/2})). Here K_g depends on α only through ε and ζ, the limiting densities of the edge count and the Zagreb index, and these constants satisfy the Painlevé-I recurrence displayed in (1.5)-(1.6). The algebraic exponent (5g-7)/2 is universal across the entire family. The same machinery reproduces Tutte's planar formula and yields Theorem 2, a new exact formula for N_1(n) for any degree sequence; the paper also notes that the same constant pattern appears in 3-regul

Load-bearing premise

The argument assumes that the power-series coefficients used in the final saddle-point step are all nonnegative, so that the single dominant singularity really controls the count; the paper states this follows from a combinatorial interpretation but does not prove it for the specific series involved.

Editorial extensions

If this is right

  • All mixed-valence Eulerian degree-proportion vectors with the same ε and ζ share the same leading constant K_g; the exponential rate Ω(α) is the only mixture-sensitive part.
  • Regular even-valence formulas for arbitrary 2p-regular maps, and the quartic and sextic cases, reduce to Theorem 1 by setting ζ=ε².
  • The exact genus-one formula in Theorem 2 gives a closed count for any degree sequence with at least one vertex of degree greater than 2; for a single valence it reduces to earlier regular-map formulas.
  • The ratio t_g defined in Remark 1.4 is independent of ε and ζ, so the Painlevé-I constants in this paper coincide, up to known factors, with constants appearing in earlier map-asymptotic work.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the paper's Conjecture 1 for odd-degree maps holds, the leading asymptotic law for all maps would be governed by the same pair of statistics and the same Painlevé-I constants, making map enumeration asymptotically one-parameter in essence.
  • The structural grading introduced in Section 5.1 suggests that the subleading corrections in V^{-1/2} are themselves organized by the same recurrence, so a full asymptotic expansion may be derivable from the same discriminant geometry.
  • The positivity and minimality gap could be checked numerically for small mixed-degree vectors; if it fails for some α, a more careful treatment of multiple critical points would be needed, possibly changing the prefactor but not the exponent.
  • The exponential-rate formula Ω(α) resembles a Shannon-type entropy with a binomial correction, hinting at a large-deviation principle for map degree sequences; if developed, the asymptotic count could yield probability distributions of vertex degrees in random large maps.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper studies connected, labeled Eulerian maps of fixed genus g with arbitrary mixed even-degree sequences. Theorem 1 states a universal asymptotic as the total number of vertices V tends to infinity: the leading term is K_g/Γ((5g-1)/2) · V^{(5g-7)/2} · V! · e^{VΩ(α)}, with K_g depending on the degree proportions α only through ε and ζ and satisfying a Painlevé-I-type recurrence. Theorem 2 gives an exact formula for genus 1 Eulerian maps. The proof combines the Hermitian matrix-model topological expansion with orthogonal-polynomial recurrence coefficients, the discrete string equation, and analytic combinatorics in several variables (ACSV). The paper also recovers Tutte's planar formula and several known regular-valence higher-genus results.

Significance. If the main theorem is correct, it is a substantial advance: it provides the first higher-genus asymptotic enumeration for mixed-valence Eulerian maps, identifies a universal dependence on only two linear functionals of the degree distribution, and connects the constants to Painlevé I. The exact genus-1 formula and the recovery of known regular cases are concrete, useful checks. The proof strategy is appropriate and much of the derivation is explicit, with substantial technical appendices. The main concerns are not with the overall architecture but with three load-bearing points: the final coefficient-extraction factor, the proof of uniqueness/minimality of the ACSV critical point, and the nonnegativity hypothesis for the singular generating functions.

major comments (3)
  1. [§5.3, proof of Theorem 1, Eq. (5.94)] As printed, the transition from Proposition 5.32 to Eq. (5.94) has a factor error. Proposition 5.32 gives [t^n]F_g = [t^n]A_g / (E(E+1)), and E ~ εV, so the displayed chain immediately before (5.94) should have [t^{αV}]F_g = [t^{αV}]A_g / (ε²V²), not multiplied by ε²V². Correspondingly, (5.94) as written — N_g = V! I_V(...) ε²V² — produces V-exponent (5g+1)/2 rather than the theorem's (5g−7)/2. If the intended formula is V! I_V/(ε²V²), all occurrences should be corrected; as it stands, the printed proof is inconsistent with the statement of Theorem 1.
  2. [§5.2.2, Proposition 5.28] The proof of the existence and uniqueness of the minimal point t(α) is too sketchy for a step that carries the entire ACSV argument. The one-sentence extremum calculation only checks that t(α) is a critical point of the height function restricted to the parametrized component Σ_cr. It does not rule out other components of the discriminant variety (such as the higher-degeneracy points mentioned in Remark 5.11) lying inside the coordinate-wise torus, nor does it prove global uniqueness of the minimum of the height function. Strict minimality is used in Proposition 5.29 to discard the contribution from the outer contour S_0 as exponentially small; without it the leading constant K_g could be altered. Please supply a complete proof of uniqueness/minimality, or state precisely which theorem from [52]/[53] applies and verify its hypotheses.
  3. [§5.2, Eq. (5.25)] The nonnegativity condition f(n)≥0 is asserted to 'come for free' from combinatorial interpretations, but it is not established for the specific functions A_g(t)/P_σ^{5g−1} that feed into Theorem 1 through Proposition 5.33. The chain A_g = Q(Q+1)F_g together with the combinatorial definition of F_g would imply f(n)=E(E+1)N_g(n) once Proposition 5.32 is applied, but this is not written out; for r_g(t) the paper relies on a cited 2-legged-map interpretation. Since both Proposition 5.27 and the contour deformation in Proposition 5.29 depend on this positivity in the chosen basis, the paper should give an explicit coefficient-positivity proof, or a precise reference that covers exactly these algebraic functions.
minor comments (4)
  1. [§5.3, Eq. (5.94)] The notation I_V( ε^g(t(α))^{5g−1} / (κ(ε−1)) C_g; ...) is ambiguous: the symbol g appears both as the genus index and as a potential function g(t) introduced in Corollary 5.18. Please disambiguate, e.g. denote the genus by g and the function by G(t).
  2. [Theorem 2, display] The displayed formula has several unmatched large brackets and the multiplication by the sum is difficult to parse. Re-typesetting the bracketed expression and indicating the scope of the product would substantially improve readability.
  3. [§5.2, Proposition 5.27] The sentence 'positive orthant in their proposition has been replaced by negative orthant here' is informal. Since the signs in the generating function are absorbed by the variables s_{2k} = -t_{2k}/(2k), state explicitly how [52, Prop. 3.17] is applied after this change of variables.
  4. [General] There are numerous small OCR/typo artifacts in the equations (e.g. missing backslashes, odd superscripts such as 'ε^g(t(α))'). A careful proofreading pass is needed before publication.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the asymptotic constants are derived from the string equation and ACSV, not fitted or assumed from the conclusion.

full rationale

Theorem 1 is obtained by a genuine derivation chain rather than by fitting or by importing the target formula. The generating functions F_g(t) are defined combinatorially in (1.24); the recurrence coefficients r_g(t;κ) are analyzed through the discrete string equation (5.1) and the explicit Riemann-Hilbert computation of r_1 (Proposition 2.5). Corollary 5.6 and Proposition 5.21 derive the singular form of r_g near the critical surface, and the constants C_g satisfying recurrence (5.55) emerge from that structural analysis rather than being imposed. Proposition 5.29 then evaluates the Cauchy-type integrals via ACSV, and Proposition 5.32 relates the coefficients of A_g to those of F_g by the exact identity E(E+1)[t^n]F_g = [t^n]A_g. No parameter is fitted to the target counts N_g(n), and no displayed equation reduces to the conclusion by construction. The paper's non-negativity hypothesis (5.25) is asserted to follow from combinatorial interpretations; for the specific functions A_g used in the theorem, positivity indeed follows from Proposition 5.32 together with the nonnegative map counts. The minimality/uniqueness argument in Proposition 5.28 is terse and might merit a more detailed proof, but this is an analytic gap, not circularity: a failure would invalidate the ACSV step rather than confirm an already-assumed result. Self-citations appear mostly in comparisons and reductions to known regular cases, and the load-bearing inputs are external results such as [10], [24], and [52]. No self-definitional, fitted-input, or self-citation-circularity pattern is present.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no fitted constants and no new postulated entities. Its free parameters are none: ε and ζ are functions of the input degree proportions α, and the constants K_g are determined by a recurrence, not by data fitting. The assumptions are external theorems and structural hypotheses about generating functions.

assumptions (5)
  • domain assumption Topological expansion F_N,N(t) = Σ_g F_g(t)/N^{2g} (Theorem 3, citing Ercolani-McLaughlin [24])
    This is the external theorem connecting the matrix-model free energy to the generating functions of connected Eulerian maps; it is a premise for extracting coefficients of F_g(t) in Section 5.3.
  • domain assumption Single-cut equilibrium measure and the Deift-Zhou asymptotic expansion of recurrence coefficients (Propositions 2.3 and 2.8, citing [10, 18, 24])
    The proof of the singular structure of r_g(t) relies on these Riemann-Hilbert results holding near the relevant critical point.
  • domain assumption ACSV coefficient-asymptotics theorems, including strict minimality of the unique critical point on the discriminant (Pemantle-Wilson-Melczer)
    Proposition 5.29 applies the ACSV framework to evaluate the Cauchy integrals; the paper cites the ACSV book and prior project results rather than proving the general theorem.
  • ad hoc to paper Nonnegativity of coefficients of Q(σ(t);t)/P_σ(σ(t);t)^Δ in (5.25)
    The paper states this 'comes for free' from combinatorial interpretations but does not prove it for A_g(t); it is a condition needed for the minimal-point analysis to apply.
  • domain assumption Structural form and grading of Freud-function expansions in Lemma 5.2
    The induction for the singular behavior of r_g(t) in Proposition 5.21 depends on the Freud-function expansion lemma, whose proof is given but relies on combinatorial structure from [31].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Universal Asymptotics and Exact Enumeration of Eulerian Maps." pith.science (2026). https://pith.science/paper/XA744J77

@misc{pith2026260714342,
  author       = {Pith},
  title        = {Pith review of: Universal Asymptotics and Exact Enumeration of Eulerian Maps},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XA744J77}},
  note         = {Machine review of arXiv:2607.14342}
}
abstract

We calculate the asymptotics of the number of connected, labeled, genus $g$ Eulerian maps with an arbitrary degree sequence, in the limit as the total number of vertices tends to infinity. This asymptotic is universal, in the sense that the leading order term depends on only finitely many map characteristics. The constant factor in this formula is related to the Painlev\'{e} I equation. Our methods combine the analysis of the recurrence coefficients associated to a particular family of orthogonal polynomials, and the theory of analytic combinatorics of several variables. We also derive an exact formula for the number of connected, labeled, genus $1$ Eulerian maps. These are the first results on this kind of enumeration problem for $g\geq 1$, non-regular (mixed-valence) maps.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

67 extracted references · 1 linked inside Pith

  1. [24]

    N. M. Ercolani and K. D. T.-R. McLaughlin. Asymptotics of the partition function for random matrices via Riemann-Hilbert techniques and applications to graphical enumeration.Int. Math. Res. Not., (14):755–820,

  2. [52]

    Pemantle and M

    R. Pemantle and M. C. Wilson. Twenty combinatorial examples of asymptotics derived from multivariate gen- erating functions.SIAM Rev., 50(2):199–272, 2008. 48

    2008

  3. [53]

    Pemantle, M

    R. Pemantle, M. C. Wilson, and S. Melczer.Analytic combinatorics in several variables, volume 212 ofCambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 2024. 1, 29, 35, 48

    2024

  4. [1]

    The Analytic Combinatorics in Several Variables (ACSV) Project.https://acsvproject.com/, Accessed: 2026-07-15. 1

    2026

  5. [2]

    E. A. Bender and E. R. Canfield. The asymptotic number of rooted maps on a surface.J. Combin. Theory Ser. A, 43(2):244–257, 1986. 1, 3

    1986

  6. [3]

    E. A. Bender, Z. Gao, and L. B. Richmond. The map asymptotics constantt g.Electron. J. Combin., 15(1):Re- search paper 51, 8, 2008. 1, 3

    2008

  7. [4]

    Bertola, B

    M. Bertola, B. Eynard, and J. Harnad. Partition functions for matrix models and isomonodromic tau functions. J. Phys. A, 36(12):3067–3083, 2003. 9, 11, 56, 57

    2003

  8. [5]

    Bertola, B

    M. Bertola, B. Eynard, and J. Harnad. Semiclassical orthogonal polynomials, matrix models and isomonodromic tau functions.Comm. Math. Phys., 263(2):401–437, 2006. 9, 56

    2006

Show all 67 references
  1. [6]

    D. Bessis. A new method in the combinatorics of the topological expansion.Comm. Math. Phys., 69(2):147–163,

  2. [7]

    Bessis, C

    D. Bessis, C. Itzykson, and J. B. Zuber. Quantum field theory techniques in graphical enumeration.Adv. in Appl. Math., 1(2):109–157, 1980. 6, 8, 9

    1980

  3. [8]

    Bleher, R

    P. Bleher, R. Gharakhloo, and K. T.-R. McLaughlin. Phase diagram and topological expansion in the complex quartic random matrix model.Comm. Pure Appl. Math., 77(2):1405–1485, 2024. 1, 6, 9, 14

    2024

  4. [9]

    P. M. Bleher and A. Dea˜ no. Topological expansion in the cubic random matrix model.Int. Math. Res. Not. IMRN, (12):2699–2755, 2013. 7, 9

    2013

  5. [10]

    P. M. Bleher and A. R. Its. Asymptotics of the partition function of a random matrix model.Ann. Inst. Fourier (Grenoble), 55(6):1943–2000, 2005. 5, 8, 9, 14, 16, 17, 29, 51

    1943

  6. [11]

    Boutroux

    P. Boutroux. Recherches sur les transcendantes de M. Painlev´ e et l’´ etude asymptotique des ´ equations diff´ erentielles du second ordre.Ann. Sci. ´Ecole Norm. Sup. (3), 30:255–375, 1913. 3

    1913

  7. [12]

    Br´ ezin, C

    E. Br´ ezin, C. Itzykson, G. Parisi, and J. B. Zuber. Planar diagrams.Comm. Math. Phys., 59(1):35–51, 1978. 1, 6, 8

    1978

  8. [13]

    Chekhov and Y

    L. Chekhov and Y. Makeenko. A hint on the external field problem for matrix models.Phys. Lett. B, 278(3):271– 278, 1992. 5

    1992

  9. [14]

    W. C. Chu. A new combinatorial interpretation for generalized Catalan number.Discrete Math., 65(1):91–94,

  10. [15]

    F. David. Planar diagrams, two-dimensional lattice gravity and surface models.Nuclear Phys. B, 257(1):45–58,

  11. [16]

    Deift, T

    P. Deift, T. Kriecherbauer, and K. T.-R. McLaughlin. New results on the equilibrium measure for logarithmic potentials in the presence of an external field.J. Approx. Theory, 95(3):388–475, 1998. 12

    1998

  12. [17]

    Deift, T

    P. Deift, T. Kriecherbauer, K. T.-R. McLaughlin, S. Venakides, and X. Zhou. Strong asymptotics of orthogonal polynomials with respect to exponential weights.Comm. Pure Appl. Math., 52(12):1491–1552, 1999. 14, 58

    1999

  13. [18]

    Deift, T

    P. Deift, T. Kriecherbauer, K. T.-R. McLaughlin, S. Venakides, and X. Zhou. Uniform asymptotics for poly- nomials orthogonal with respect to varying exponential weights and applications to universality questions in random matrix theory.Comm. Pure Appl. Math., 52(11):1335–1425,...

    1999

  14. [19]

    Deift and X

    P. Deift and X. Zhou. A steepest descent method for oscillatory Riemann-Hilbert problems. Asymptotics for the MKdV equation.Ann. of Math. (2), 137(2):295–368, 1993. 11 64 AHMAD BARHOUMI, ROOZBEH GHARAKHLOO, AND NATHAN HAYFORD

    1993

  15. [20]

    Di Francesco

    P. Di Francesco. 2D quantum gravity, matrix models and graph combinatorics. 221:33–88, 2006. 8 [21]NIST Digital Library of Mathematical Functions.https://dlmf.nist.gov/, Release 1.2.4 of 2025-03-15. F. W. J. Olver, A. B. Olde Daalhuis, D. W. Lozier, B. I. Schneider, R. F. Bois...

    2006

  16. [22]

    Ercolani, J

    N. Ercolani, J. Lega, and B. Tippings. Non-recursive counts of graphs on surfaces.Enumer. Comb. Appl., 3(3):Paper No. S2R20, 24, 2023. 1, 6, 14, 27, 55

    2023

  17. [23]

    N. M. Ercolani. Caustics, counting maps and semi-classical asymptotics.Nonlinearity, 24(2):481–526, 2011. 35

    2011

  18. [25]

    N. M. Ercolani, K. D. T.-R. McLaughlin, and V. U. Pierce. Random matrices, graphical enumeration and the continuum limit of Toda lattices.Comm. Math. Phys., 278(1):31–81, 2008. 1, 8, 9, 14, 36

    2008

  19. [26]

    N. M. Ercolani and P. Waters. Relating random matrix map enumeration to a universal symbol calculus for recurrence operators in terms of Bessel-Appell polynomials.Random Matrices Theory Appl., 11(4):Paper No. 2250037, 152, 2022. 6, 7

    2022

  20. [27]

    Eynard.Counting surfaces, volume 70 ofProgress in Mathematical Physics

    B. Eynard.Counting surfaces, volume 70 ofProgress in Mathematical Physics. Birkh¨ auser/Springer, [Cham],

  21. [28]

    P. D. Francesco, P. Ginsparg, and J. Zinn-Justin. 2d gravity and random matrices.Phys. Rept., 254(1):1–133,

  22. [29]

    Z. Gao. A pattern for the asymptotic number of rooted maps on surfaces.J. Combin. Theory Ser. A, 64(2):246– 264, 1993. 3

    1993

  23. [30]

    I. M. Gessel. Lagrange inversion.J. Combin. Theory Ser. A, 144:212–249, 2016. 18

    2016

  24. [31]

    Gharakhloo and T

    R. Gharakhloo and T. L. Latimer. Combinatorics of even-valent graphs on Riemann surfaces. ArXiv 2505.01633,

  25. [32]

    I. P. Goulden and D. M. Jackson. The KP hierarchy, branched covers, and triangulations.Adv. Math., 219(3):932– 951, 2008. 3

    2008

  26. [33]

    R. L. Graham, D. E. Knuth, and O. Patashnik.Concrete mathematics. Addison-Wesley Publishing Company, Reading, MA, second edition, 1994. A foundation for computer science. 54

    1994

  27. [34]

    Gutman and K

    I. Gutman and K. C. Das. The first Zagreb index 30 years after.MATCH Commun. Math. Comput. Chem., (50):83–92, 2004. 2

    2004

  28. [35]

    Gutman and N

    I. Gutman and N. Trinajsti´ c. Graph theory and molecular orbitals, totalπ-electron energy of alternant hydron- carbons.Chem. Phys. Lett., 17:535–538, 1972. 2

    1972

  29. [36]

    M. E. H. Ismail.Classical and quantum orthogonal polynomials in one variable, volume 98 ofEncyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2005. With two chapters by Walter Van Assche, With a foreword by Richard A. Askey. 11, 57

    2005

  30. [37]

    A. R. Its, A. V. Kitaev, and A. S. Fokas. An isomonodromy approach to the theory of two-dimensional quantum gravity.Uspekhi Mat. Nauk, 45(6(276)):135–136, 1990. 10

    1990

  31. [38]

    Jimbo and T

    M. Jimbo and T. Miwa. Monodromy preserving deformation of linear ordinary differential equations with rational coefficients. II.Phys. D, 2(3):407–448, 1981. 11

    1981

  32. [39]

    Jimbo and T

    M. Jimbo and T. Miwa. Monodromy preserving deformation of linear ordinary differential equations with rational coefficients. III.Phys. D, 4(1):26–46, 1981/82. 11

    1981

  33. [40]

    Jimbo, T

    M. Jimbo, T. Miwa, and K. Ueno. Monodromy preserving deformation of linear ordinary differential equations with rational coefficients. I. General theory andτ-function.Phys. D, 2(2):306–352, 1981. 11, 56

    1981

  34. [41]

    A. A. Kapaev. Quasi-linear Stokes phenomenon for the Painlev´ e first equation.J. Phys. A, 37(46):11149–11167,

  35. [42]

    V. Kazakov. Bilocal regularization of models of random surfaces.Physics Letters B, 150(4):282–284, 1985. 1, 8

    1985

  36. [43]

    Kontsevich

    M. Kontsevich. Intersection theory on the moduli space of curves and the matrix Airy function.Comm. Math. Phys., 147(1):1–23, 1992. 8

    1992

  37. [44]

    A. B. J. Kuijlaars and K. T.-R. McLaughlin. Generic behavior of the density of states in random matrix theory and equilibrium problems in the presence of real analytic external fields.Comm. Pure Appl. Math., 53(6):736– 785, 2000. 12

    2000

  38. [45]

    J. L. Lagrange. Nouvelle m´ ethode pour r´ esoudre les ´ equations litt´ erales par le moyen des s´ eries.M´ emoires de l’Acad´ emie royale des sciences et Belles-Lettres de Berlin, XXIV:5–73, 1770. 18 UNIVERSAL ASYMPTOTICS AND EXACT ENUMERA TION OF EULERIAN MAPS65

  39. [46]

    A. P. Magnus. On Freud’s equations for exponential weights.J. Approx. Theory, 46(1):65–99, 1986. Papers dedicated to the memory of G´ eza Freud. 29

    1986

  40. [47]

    S. R. Mane. Multiparameter Fuss–Catalan numbers with application to algebraic equations, 2024. ArXiv1607.04144. 4, 5

    2024 arXiv

  41. [48]

    M. L. Mehta.Random matrices, volume 142 ofPure and Applied Mathematics (Amsterdam). Elsevier/Academic Press, Amsterdam, third edition, 2004. 9

    2004

  42. [49]

    L. A. Pastur. Spectral and probabilistic aspects of matrix models. InAlgebraic and geometric methods in mathe- matical physics (Kaciveli, 1993), volume 19 ofMath. Phys. Stud., pages 207–242. Kluwer Acad. Publ., Dordrecht,

    1993

  43. [50]

    Pemantle and M

    R. Pemantle and M. C. Wilson. Asymptotics of multivariate sequences. I. Smooth points of the singular variety. J. Combin. Theory Ser. A, 97(1):129–161, 2002. 35

    2002

  44. [51]

    Pemantle and M

    R. Pemantle and M. C. Wilson. Asymptotics of multivariate sequences. II. Multiple points of the singular variety. Combin. Probab. Comput., 13(4-5):735–761, 2004. 35

    2004

  45. [54]

    G. N. Raney. Functional composition patterns and power series reversion.Trans. Amer. Math. Soc., 94:441–451,

  46. [55]

    E. B. Saff and V. Totik.Logarithmic potentials with external fields, volume 316 ofGrundlehren der mathe- matischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 1997. Appendix B by Thomas Bloom. 12, 17

    1997

  47. [56]

    Schaeffer

    G. Schaeffer. Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees. Electron. J. Combin., 4(1):Research Paper 20, 14, 1997. 3, 4

    1997

  48. [57]

    Sherman and W

    J. Sherman and W. J. Morrison. Adjustment of an inverse matrix corresponding to a change in one element of a given matrix.Ann. Math. Statistics, 21:124–127, 1950. 47

    1950

  49. [58]

    Szeg˝ o.Orthogonal polynomials, volume Vol

    G. Szeg˝ o.Orthogonal polynomials, volume Vol. XXIII ofAmerican Mathematical Society Colloquium Publica- tions. American Mathematical Society, Providence, RI, fourth edition, 1975. 9

    1975

  50. [59]

    ’t Hooft

    G. ’t Hooft. A planar diagram theory for strong interactions.Nuclear Physics B, 72(3):461–473, 1974. 1, 8

    1974

  51. [60]

    ’t Hooft

    G. ’t Hooft. Counting planar diagrams with various restrictions.Nuclear Phys. B, 538(1-2):389–410, 1999. 8

    1999

  52. [61]

    W. T. Tutte. A census of slicings.Canadian J. Math., 14:708–722, 1962. 1, 3

    1962

  53. [62]

    Waters.Combinatorics of the Hermitian one-matrix model

    P. Waters.Combinatorics of the Hermitian one-matrix model. ProQuest LLC, Ann Arbor, MI, 2015. Thesis (Ph.D.)–The University of Arizona. 5

    2015

  54. [63]

    P. Waters. Solution of string equations for asymmetric potentials.Nuclear Phys. B, 899:265–288, 2015. 5

    2015

  55. [64]

    E. T. Whittaker and G. N. Watson.A course of modern analysis—an introduction to the general theory of infinite processes and of analytic functions with an account of the principal transcendental functions. Cambridge University Press, Cambridge, fifth edition, 2021. With a fore...

    2021

  56. [65]

    E. Witten. Two-dimensional gravity and intersection theory on moduli space. InSurveys in differential geometry (Cambridge, MA, 1990), pages 243–310. Lehigh Univ., Bethlehem, PA, 1991. 8

    1990

  57. [66]

    A. Zvonkin. Matrix integrals and map enumeration: an accessible introduction.Math. Comput. Modelling, 26(8-10):281–304, 1997. Combinatorics and physics (Marseilles, 1995). 8 Department of Mathematics, Grinnell College, Grinnell, IA, USA Email address:barhoumia@grinnell.edu Mat...

    1997

  58. [2016]

    CRM Aisenstadt chair lectures. 4

  59. [2025]

    1, 6, 14, 23, 29, 35

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.