Pith. sign in

REVIEW 3 major objections 3 minor 3 cited by

Lattice path combinatorics in superconformal Yang-Mills theories

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

Pith's one-line read Bessel determinants in planar superconformal Yang–Mills theories are weighted sums over generalized Dyck paths, with universal positive-integer coefficients.

desk verdict Solid proof of the differential-difference equation and a suggestive lattice-path interpretation verified only through n=7; the all-orders universality claim needs to be labeled as a conjecture. read the letter →

arxiv 2508.20901 v1 pith:5QAMXU3W submitted 2025-08-28 hep-th math-phmath.COmath.FAmath.MP

classification hep-thmath-phmath.COmath.FAmath.MP
keywords superconformalYang-MillsplanarlimitFredholmdeterminantBesselkerneliteratedChenintegralsgeneralizedDyckpathslatticepathenumerationTracy-Widomdistribution
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 studies observables in four-dimensional superconformal Yang–Mills theories that, in the planar limit, are infinite determinants of semi-infinite matrices built from Bessel functions. It shows that these determinants obey one nonlinear differential-difference equation in the index ℓ, and that iterating this equation yields an expansion in repeated (Chen) integrals. The central claim is that the coefficients of this expansion are universal positive integers—independent of the coupling, of ℓ, and of the particular observable—and that they are exactly the weights of an ensemble of generalized Dyck paths confined to a wedge-shaped envelope. If this holds, a broad class of gauge-theory observables acquires a hidden combinatorial backbone: each observable is, up to two initial functions, a weighted count of paths. The path partition function encodes the full solution, with weights fixed by a simple box-counting rule inside each wedge.

What carries the argument

The load-bearing objects are the iterated Chen integrals I_{σ_1···σ_k}(g) defined in (3.12) as nested integrals of d log f_+ and d log f_−, where f_± are determined by the initial pair D_{ℓ−1}, D_ℓ through (3.7). The ansatz (3.18) expresses every d_n as a linear combination of these integrals with prescribed counts of + and − signs; the shuffle product (3.14) makes products of integrals tractable and forces the coefficient matching. The combinatorial mechanism is the bijection between admissible sign sequences and paths confined to the wedge envelope of Figure 4, with the single-wedge weight w_{m→m+2} = ∏_i ((m−i)/(m−i+2))^{b_i} computed from box counts (4.19). This converts the differential

What would settle it

Solve the differential system (3.6) for n = 8 without imposing the ansatz—numerically or symbolically for a generic symbol—and compare the resulting coefficient list with the path-partition prediction and with the 197,148 non-zero coefficient count in Table 1; any mismatch in a coefficient or in the number of terms falsifies the universal combinatorial formula.

Watch

Extended reading notes

Core claim

The paper's central claim is that the general solution of the differential system (3.6)—equivalent to the determinant identity (1.7)—is a weighted count of lattice paths. Concretely, for each n the normalized observable d_n(g) equals G(n+1) times the partition function Z_n(g) of equation (4.6), a sum over generalized Dyck paths of length k = n(n−1)/2. Each path is encoded by a sign sequence σ_1···σ_k, must start with +− (or −+ for odd n), end with two like steps, and stay inside the wedge envelope of Figure 4; sequences violating this selection rule have coefficient zero. The coefficients c_{σ_1···σ_k} are positive integers depending only on n, not on the coupling g, the parameter ℓ, or the

Load-bearing premise

The all-orders result rests on assuming that every solution d_n of the differential system is a linear combination of the iterated integrals with the prescribed numbers of + and − signs, and that these integrals are linearly independent for generic f_±; this is verified explicitly only for n up to 7.

Editorial extensions

If this is right

  • All observables in the class (1.1) are, up to the two initial functions f_±, universal path sums; changing the symbol χ(x) or ℓ changes only the iterated integrals, never the coefficients.
  • The selection rule (4.3) makes the all-orders expansion of D_{ℓ+n} computable without solving the differential system; counting allowed paths reproduces the non-zero coefficient counts 1, 1, 2, 10, 120, 3276, 197148 in Table 1.
  • Closed-form cases (Tracy–Widom, circular Wilson loop, flux tube) satisfy the same equation and enforce the sum rule (3.26), so the universal coefficients can be extracted from known examples and then applied to unknown ones.
  • Flux-tube correlators at ℓ ≥ 3 become harmonic-polylogarithm combinations of weight k = n(n−1)/2, showing that the combinatorial coefficients fix the transcendental structure of these observables.
  • In the double-scaling regime (5.4), the path partition function must reproduce the strong-coupling asymptotic expansion (5.5)–(5.6), linking the combinatorial picture to Fisher–Hartwig and Szegő asymptotics.

Reading between the lines

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

  • Any differential-difference system with the same algebraic form and positive log-derivatives would carry the same universal combinatorial coefficients, so the path picture may apply to other families of observables beyond the Bessel determinants studied here.
  • The factorization of reducible-path weights and the box-counting rule for single wedges suggest a transfer-matrix or integrable-lattice formulation of Z_n(g); computing w_{m→m+3} in closed form beyond the example (4.23) would be a natural next step.
  • In the power-law regime of Appendix B, the iterated integrals become height functions, which suggests that the finite-coupling partition function may admit a probabilistic reading as an ensemble of random paths.
  • The linear-independence assumption on iterated integrals for generic f_± is the main gap: for special symbols where f_+ and f_− are power-law related, degenerate linear relations could make the coefficient matching non-unique.
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 / 3 minor

Summary. This paper studies Fredholm determinants D_l(g) of semi-infinite Bessel-kernel operators that arise for several planar supersymmetric gauge-theory observables. Its first result is an exact derivation, in Appendix A, of the differential-difference equation (1.7) relating D_{l+1}, D_l and D_{l-1}. This equation is then converted into the recursion (3.2), which expresses D_{l+n} in terms of the initial data D_{l-1} and D_l. The paper proposes that the normalized functions d_n(g) defined in (3.3) admit an expansion (3.18) in iterated Chen integrals I_{σ1...σk}(g), with the numbers of + and − letters fixed by (3.19), and with coefficients c_{σ1...σk} that are universal positive integers. Explicit coefficient sets are reported for n=5,6,7, the Wilson-loop and flux-tube closed forms are checked, and sum rules are derived in Appendix B. The final part maps each nonzero coefficient to a generalized Dyck path in a wedge-shaped envelope (Figure 4), defines a partition function Z_n(g) with box weights ω_h (4.18), and claims d_n(g)=G(n+1)Z_n(g) for all n.

Significance. If the all-orders universality statement were established, this would be a substantial and elegant connection between integrable determinants in supersymmetric gauge theory and enumerative combinatorics, generalizing Dyck paths. The proof of (1.7) in Appendix A is a concrete, exact result, and the closed-form checks in Section 2 provide nontrivial support. The explicit coefficient tables and ancillary Mathematica files are a strength: they make the n≤7 evidence reproducible. However, the all-orders claim rests on unproved linear independence of iterated integrals and on selection rules inferred from low n; as it stands, the combinatorial interpretation is an evidence-backed conjecture rather than a proven theorem.

major comments (3)
  1. [Section 3.3, Eq. (B.3)] The coefficient-matching procedure that yields the universal positive-integer structure relies on the assumption, stated in Section 3.3, that iterated integrals I_{σ1...σk}(g) for different words are independent functions of g for generic f_±. No proof is given. This is not a harmless technicality: in the monomial family d log f_± = d(g h_±) used in Appendix B, Eq. (B.3) shows that all words with fixed (k_+, k_-) are proportional to the same power g^{k_+ h_+ + k_- h_-}, with only word-dependent constants; linear independence fails identically in this family. The explicit solutions for n=5,6,7 are therefore the only evidence that the overdetermined system for the coefficients has a universal solution. Please prove the independence assertion for generic f_±, or explicitly state the ansatz and independence as a conjecture and restrict the unconditional claims accordingly.
  2. [Section 4.2–4.3, Eqs. (4.3), (4.6)–(4.7), (4.19)] The selection rule (4.3) and the box-weight formula (4.19) are inferred from the n=2,...,7 solutions and then used to define Z_n(g) for arbitrary n. The text says that the solutions for n up to 7 'all obey' the rule and that the rule 'circumvents' explicit calculation for higher n. Since the identity d_n(g)=G(n+1)Z_n(g) is the paper's central combinatorial claim, its status for n≥8 is conjectural. The factorization property (4.9) is likewise empirical. This is not circular, because the coefficients are derived from the differential equation rather than fitted, but the definition of Z_n is not independent of the data used to infer it. Please provide a proof that the admissible paths are exactly those captured by (4.3) and that the weights satisfy (4.19) for all n, or verify at least one n>7 and state the general result as a conjecture.
  3. [Section 3.3–3.4, Eqs. (3.19), (3.22)] The ansatz (3.18) is only motivated by the low-n data: the values of k_+ and k_- in (3.19) and the fixed boundary signs in (3.22) are observed for n≤7 but are not derived from the differential system (3.6). These constraints determine which words are allowed in the expansion, and hence the resulting path interpretation. The paper would be strengthened by a direct argument, or by a clearly labelled conjecture, explaining why the ansatz with these specific counts and boundary signs is the full solution for all n. As written, the universal-coefficient claim and the associated lattice-path correspondence are an extrapolation from finitely many cases.
minor comments (3)
  1. [Section 4.2, Figure 4] The envelope defining the selection rule (4.3) is described only pictorially. Since the rule is central to the paper, an analytic description of the wedge boundaries (coordinates of the points p_m and inequalities defining the allowed region) would make the rule testable and would clarify the discussion of irreducible and reducible paths.
  2. [Section 4.4, Eq. (4.18)] The weight ω_h in (4.18) depends on m through both the numerator and denominator, but the notation suppresses this dependence. Writing ω_h^{(m)} would avoid confusion in the later formulas and in the comparison with (4.22).
  3. [Section 3.4, Table 1] The sentence 'The exact solutions for d_n (with n≥5) ... are indeed captured by the ansatz' would be more informative if the size of the overdetermined linear system for n=5,6,7 were reported. This would give the reader a quantitative sense of the nontrivial consistency required for the ansatz to work.

Circularity Check

1 steps flagged · score 4.0 of 10

The lattice-path partition function is defined from the already-computed coefficients, so the central 'coincidence' is by construction; the differential-equation derivation remains independent.

  1. renaming known result [Section 4.3, Eqs. (4.4), (4.6), (4.7)]
    "For convenience, we normalize all coefficients by the maximal one, introducing the notation w_σ1σ2...σk = c_σ1σ2...σk / G(n + 1) ... Z_n(g) = Σ w_σ1σ2...σk I_σ1σ2...σk(g) ... The solution (3.18) is related to this partition function as d_n(g) = G(n + 1) Z_n(g)."

    Z_n is defined in (4.6) using weights w from (4.4), which are just the previously solved expansion coefficients c divided by G(n+1). Substituting (4.4) into (4.6) and then into (4.7) gives d_n = G · Σ (c/G) I = Σ c I, which is exactly the ansatz (3.18). Thus the asserted identity between d_n and the lattice-path partition function holds by construction, not by independent combinatorial counting. The path weights and selection rule were inferred from the same explicit n ≤ 7 solutions, so the lattice-path interpretation is a relabeling of the computed coefficients rather than an independent prediction of them.

full rationale

The core derivation of the differential-difference equation (1.7) is self-contained: Appendix A proves it from the Fredholm determinant representation, so references [30,31] are not load-bearing. The coefficients c in (3.18) are obtained by solving the overdetermined system from (3.6) for n ≤ 7, not by fitting to lattice-path data, and the explicit expressions are reproducible. The genuine circular element is in Section 4: the 'partition function' is defined by normalizing and summing the already-computed coefficients, so the central relation d_n = G(n+1) Z_n is an identity by definition. The paper also relies on two unproved extrapolations: the assumption in Section 3.3 that distinct iterated integrals are linearly independent for generic f±, and the inference in Sections 4.2–4.3 that the selection rule and weight formulas, checked only for n ≤ 7, hold for arbitrary n. These are omitted proofs/conjectures rather than internal circularities, but they mean the all-orders universality claim is not established. No load-bearing self-citation chain or imported uniqueness theorem was found.

Assumptions & free parameters 1 free parameters · 3 assumptions · 1 invented entities

The physical derivation introduces no free parameters: the coefficients are computed from the differential equation. The combinatorial layer introduces a fitted box weight and two explicit unproved assumptions (linear independence of iterated integrals and the completeness of the ansatz). The generalized Dyck path ensemble is an invented combinatorial object with no independent falsifiable handle beyond the paper's own computations.

free parameters (1)
  • box weight omega_h = (m-h)/(m-h+2) = rational numbers depending on m and h
    Introduced in (4.18) to reproduce the path weights w_{m to m+2} extracted from the computed d_n for n up to 7; it is chosen by hand rather than derived from first principles.
assumptions (3)
  • domain assumption The determinant representation (1.1) with the Bessel kernel and the symbol functions in (1.5) correctly describes the physical observables (Wilson loop, flux tube correlators, octagon, localization integrals).
    Taken from the cited literature [4-16, 20]; the paper builds on this representation without re-deriving it from gauge theory.
  • ad hoc to paper For generic f_+ and f_-, the iterated integrals I_{sigma_1...sigma_k}(g) for different sequences are linearly independent functions of g.
    Stated in Section 3.3 as an assumption to make coefficient matching well-defined; not proven, and the paper notes it is a priori unlikely that generic solutions admit the ansatz.
  • ad hoc to paper The ansatz (3.18) with k_+ and k_- fixed by (3.19) captures the full solution of (3.6) for all n.
    Verified explicitly for n=2,...,7; the extension to arbitrary n is conjectural and is used to claim universality of the coefficients.
invented entities (1)
  • Generalized Dyck paths confined to the wedge envelope (Figure 4)
    purpose: Combinatorial encoding of the expansion coefficients in (3.18) and the partition function (4.6)
    The path ensemble is reverse-engineered from the small-n solutions; there is no independent confirmation beyond n=7, and the selection rule is inferred from the data.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Lattice path combinatorics in superconformal Yang-Mills theories." pith.science (2026). https://pith.science/paper/5QAMXU3W

@misc{pith2026250820901,
  author       = {Pith},
  title        = {Pith review of: Lattice path combinatorics in superconformal Yang-Mills theories},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5QAMXU3W}},
  note         = {Machine review of arXiv:2508.20901}
}
read the original abstract

We study a class of observables in four-dimensional superconformal Yang--Mills theories which, in the planar limit at finite 't Hooft coupling, can be expressed as determinants of semi-infinite matrices built from Bessel functions. This determinant representation points to an underlying integrable structure, which we make explicit by showing that the observables satisfy a nonlinear differential-difference equation. We argue that the solution to this equation admits an expansion in terms of iterated Chen integrals of uniform transcendental weight. Remarkably, the coefficients in this expansion are universal positive integers, independent of the particular observable, suggesting a hidden combinatorial origin. Building on this observation, we show that the resulting expressions possess a natural interpretation in enumerative combinatorics: they coincide with the partition function (or generating function) of an ensemble of lattice paths constrained to a nontrivial domain. This correspondence extends and generalizes the classical Dyck paths to a richer family of path ensembles relevant in gauge theory.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Positivity properties of observables in planar maximally supersymmetric Yang-Mills theory

    hep-th 2026-06 unverdicted novelty 6.0 of 10

    Several observables in planar N=4 SYM, including the octagon anomalous dimension and Bremsstrahlung function, admit a once-subtracted dispersion representation over a positive measure in the coupling.

  2. Strong coupling structure of $\mathcal{N}=4$ SYM observables with matrix Bessel kernel

    hep-th 2026-02 unverdicted novelty 6.0 of 10

    Reorganizing the transseries of matrix Bessel kernel determinants at strong coupling yields a simple structure where non-perturbative corrections are directly determined by the perturbative series for N=4 SYM observables.

  3. Strong coupling structure of $\mathcal{N}=4$ SYM observables with matrix Bessel kernel

    hep-th 2026-02 conditional novelty 6.0 of 10

    The strong-coupling transseries for matrix Bessel determinant observables is generated from its perturbative part by shifting a→a−Δ and replacing moments I_n, with all Stokes constants fixed by two recurrences.

Reference graph

Works this paper leans on

43 extracted references · 14 canonical work pages · cited by 2 Pith papers

  1. [1]

    Bajnok, B

    Z. Bajnok, B. Boldis and G. P. Korchemsky, Tracy-Widom Distribution in Four-Dimensional Supersymmetric Yang-Mills Theories, Phys. Rev. Lett. 133 (2024) 031601, [ 2403.13050]

  2. [2]

    Bajnok, B

    Z. Bajnok, B. Boldis and G. P. Korchemsky, Solving four-dimensional superconformal Yang-Mills theories with Tracy-Widom distribution , JHEP 04 (2025) 005, [ 2409.17227]

  3. [3]

    Bajnok, B

    Z. Bajnok, B. Boldis and G. P. Korchemsky, Exploring superconformal Yang-Mills theories through matrix Bessel kernels , SciPost Phys. 19 (2025) 004, [ 2412.08732]

  4. [4]

    Beisert, B

    N. Beisert, B. Eden and M. Staudacher, Transcendentality and Crossing, J. Stat. Mech. 0701 (2007) P01021, [ hep-th/0610251]

  5. [5]

    Kostov, V

    I. Kostov, V. B. Petkova and D. Serban, Determinant Formula for the Octagon Form Factor in N =4 Supersymmetric Yang-Mills Theory , Phys. Rev. Lett. 122 (2019) 231601, [ 1903.05038]

  6. [6]

    Kostov, V

    I. Kostov, V. B. Petkova and D. Serban, The Octagon as a Determinant , JHEP 11 (2019) 178, [1905.11467]

  7. [7]

    A. V. Belitsky and G. P. Korchemsky, Exact null octagon , JHEP 05 (2020) 070, [ 1907.13131]

  8. [8]

    Basso, L

    B. Basso, L. J. Dixon and G. Papathanasiou, Origin of the Six-Gluon Amplitude in Planar N = 4 Supersymmetric Yang-Mills Theory, Phys. Rev. Lett. 124 (2020) 161603, [ 2001.05460]

Show all 43 references
  1. [9]

    A. V. Belitsky and G. P. Korchemsky, Octagon at finite coupling , JHEP 07 (2020) 219, [2003.01121]

  2. [10]

    A. V. Belitsky and G. P. Korchemsky, Crossing bridges with strong Szeg˝ o limit theorem, JHEP 04 (2021) 257, [ 2006.01831]

  3. [11]

    Beccaria, M

    M. Beccaria, M. Bill` o, F. Galvagno, A. Hasan and A. Lerda, N = 2 Conformal SYM theories at large N , JHEP 09 (2020) 116, [ 2007.02840]

  4. [12]

    orientifold

    M. Beccaria, G. V. Dunne and A. A. Tseytlin, BPS Wilson loop in N = 2 superconformal SU(N) “orientifold” gauge theory and weak-strong coupling interpolation , JHEP 07 (2021) 085, [2104.12625]

  5. [13]

    Beccaria, M

    M. Beccaria, M. Bill` o, M. Frau, A. Lerda and A. Pini, Exact results in a N = 2 superconformal gauge theory at strong coupling , JHEP 07 (2021) 185, [ 2105.15113]

  6. [14]

    Billo, M

    M. Billo, M. Frau, F. Galvagno, A. Lerda and A. Pini, Strong-coupling results for N = 2 superconformal quivers and holography, JHEP 10 (2021) 161, [ 2109.00559]

  7. [15]

    Beccaria, G

    M. Beccaria, G. P. Korchemsky and A. A. Tseytlin, Strong coupling expansion in N = 2 superconformal theories and the Bessel kernel , JHEP 09 (2022) 226, [ 2207.11475]

  8. [16]

    Beccaria, G

    M. Beccaria, G. P. Korchemsky and A. A. Tseytlin, Non-planar corrections in orbifold/orientifold N = 2 superconformal theories from localization , JHEP 05 (2023) 165, [2303.16305]

  9. [17]

    Beisert et al., Review of AdS/CFT Integrability: An Overview , Lett

    N. Beisert et al., Review of AdS/CFT Integrability: An Overview , Lett. Math. Phys. 99 (2012) 3–32, [1012.3982]

  10. [18]

    Pestun and et al., Localization techniques in quantum field theories , Journal of Physics A: Mathematical and Theoretical 50 (oct, 2017) 440301

    V. Pestun and et al., Localization techniques in quantum field theories , Journal of Physics A: Mathematical and Theoretical 50 (oct, 2017) 440301. – 34 –

  11. [19]

    Basor and T

    E. Basor and T. Ehrhardt, Asymptotics of Determinants of Bessel Operators , Comm. Math. Phys. 234 (2003) 491–516, [ math/0204304]

  12. [20]

    G. W. Semenoff and K. Zarembo, More exact predictions of SUSYM for string theory , Nucl. Phys. B 616 (2001) 34–46, [ hep-th/0106015]

  13. [21]

    Coronado, Perturbative four-point functions in planar N = 4 SYM from hexagonalization , JHEP 01 (2019) 056, [ 1811.00467]

    F. Coronado, Perturbative four-point functions in planar N = 4 SYM from hexagonalization , JHEP 01 (2019) 056, [ 1811.00467]

  14. [22]

    Coronado, Bootstrapping the Simplest Correlator in Planar N = 4 Supersymmetric Yang-Mills Theory to All Loops , Phys

    F. Coronado, Bootstrapping the Simplest Correlator in Planar N = 4 Supersymmetric Yang-Mills Theory to All Loops , Phys. Rev. Lett. 124 (2020) 171601, [ 1811.03282]

  15. [23]

    P. J. Forrester, The spectrum edge of random matrix ensembles , Nucl. Phys. B 402 (1993) 709–728

  16. [24]

    V. E. Korepin, N. M. Bogoliubov and A. G. Izergin, Quantum Inverse Scattering Method and Correlation Functions. Cambridge Monographs on Mathematical Physics. Cambridge University Press, Cambridge, 1993, 10.1017/CBO9780511628832

  17. [25]

    Harnad and F

    J. Harnad and F. Balogh, Tau Functions and their Applications . Cambridge Monographs on Mathematical Physics. Cambridge University Press, 2021

  18. [26]

    C. A. Tracy and H. Widom, Level spacing distributions and the Bessel kernel , Commun. Math. Phys. 161 (1994) 289–310, [ hep-th/9304063]

  19. [27]

    Okamoto, Studies on the painlev´ e equations ii

    K. Okamoto, Studies on the painlev´ e equations ii. fifth painlev´ e equation pv, Japanese journal of mathematics. New series 13 (1987) 47–76

  20. [28]

    Kajiwara, T

    K. Kajiwara, T. Masuda, M. Noumi, Y. Ohta and Y. Yamada, Determinant formulas for the toda and discrete toda equations , solv-int/9908007

  21. [29]

    P. J. Forrester and N. S. Witte, Application of the τ −function theory of painlev´ e equations to random matrices: Pv, piii, the lue, jue, and cue , Communications on Pure and Applied Mathematics 55 (2002) 679–727

  22. [30]

    Ferrando, S

    G. Ferrando, S. Komatsu, G. Lefundes and D. Serban, Exact Three-Point Functions in N = 2 Superconformal Field Theories: Integrability vs. Localization , 2503.07295

  23. [31]

    G. P. Korchemsky and A. Testa, Correlation functions in four-dimensional superconformal long circular quivers, JHEP 07 (2025) 223, [ 2501.17223]

  24. [32]

    Polylogarithms as a Bridge between Number Theory and Particle Physics

    C. Vergu, Polylogarithms and physical applications , in Summer School “Polylogarithms as a Bridge between Number Theory and Particle Physics”, July 2013, Durham, UK

  25. [33]

    Abreu, R

    S. Abreu, R. Britto and C. Duhr, The SAGEX review on scattering amplitudes Chapter 3: Mathematical structures in Feynman integrals , J. Phys. A 55 (2022) 443004, [ 2203.13014]

  26. [34]

    Krattenthaler, Lattice Path Enumeration, pp

    C. Krattenthaler, Lattice Path Enumeration, pp. 589 – 678. Discrete mathematics and its applications. CRC Press Taylor & Francis Group, 2015

  27. [35]

    P. J. Forrester and T. D. Hughes, Complex wishart matrices and conductance in mesoscopic systems: Exact results , Journal of Mathematical Physics 35 (12, 1994) 6736–6747

  28. [36]

    P. J. Forrester, Painlev´ e transcendent evaluation of the scaled distribution of the smallest eigenvalue in the laguerre orthogonal and symplectic ensembles , nlin/0005064. – 35 –

  29. [37]

    Remiddi and J

    E. Remiddi and J. A. M. Vermaseren, Harmonic polylogarithms, Int. J. Mod. Phys. A 15 (2000) 725–754, [hep-ph/9905237]

  30. [38]

    Maitre, HPL, a mathematica implementation of the harmonic polylogarithms , Comput

    D. Maitre, HPL, a mathematica implementation of the harmonic polylogarithms , Comput. Phys. Commun. 174 (2006) 222–240, [ hep-ph/0507152]

  31. [39]

    Szeg˝ o,Ein Grenzwertsatz fiber die Toeplitzschen Determinanten einer reellen positiven Funktion, Math

    G. Szeg˝ o,Ein Grenzwertsatz fiber die Toeplitzschen Determinanten einer reellen positiven Funktion, Math. Ann. 76 (1915) 490–503

  32. [40]

    M. E. Fisher and R. E. Hartwig, Toeplitz Determinants: Some Applications, Theorems, and Conjectures, Adv. Chem. Phys. 15 (1968) 333–353

  33. [41]

    Stanley, Enumerative Combinatorics

    R. Stanley, Enumerative Combinatorics. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2023

  34. [42]

    Di Francesco, O

    P. Di Francesco, O. Golinelli and E. Guitter, Meanders and the Temperley-Lieb algebra , Commun. Math. Phys. 186 (1997) 1–59, [ hep-th/9602025]

  35. [43]

    Bargheer, F

    T. Bargheer, F. Coronado and P. Vieira, Octagons II: Strong Coupling , 1909.04077. – 36 –

Pith tools

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