arxiv: 2602.16088 · v4 · submitted 2026-02-17 · ✦ hep-th · math-ph· math.MP

Recognition: 2 theorem links

· Lean Theorem

Group character averages via a single Laguerre

Alexei Morozov , Kazumi Okuyama

Authors on Pith no claims yet

Pith reviewed 2026-05-15 21:12 UTC · model grok-4.3

classification ✦ hep-th math-phmath.MP

keywords Laguerre polynomialGaussian matrix modelgroup characterSchur polynomialweak compositionsum rulestrace identity

0 comments

The pith

Arbitrary traces in the Gaussian matrix model reduce to convolutions of one Laguerre polynomial L_{N-1}^1.

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

The paper shows that the average of Tr_R e^X, a group character in the Gaussian matrix model, generalizes the Schur polynomial by replacing time variables with traces of products of non-commuting matrices A_k. These matrices are built from extended Laguerre polynomials and the traces are labeled by weak compositions. The main result is a set of generic sum rules that rewrite any such trace as a convolution involving only the single Laguerre polynomial L_{N-1}^1(z_{k_i}). A reader would care because this replaces a multi-matrix expression with operations on one function, reducing the algebraic complexity of exact calculations in matrix models.

Core claim

The average of exponential Tr_R e^X in the Gaussian matrix model is a generalization of the Schur polynomial in which time variables are replaced by traces of products of non-commuting matrices Tr(prod_i A_{k_i}) labeled by weak compositions. The matrix entries come from extended Laguerre polynomials. Generic sum rules express arbitrary traces through convolutions of the single Laguerre polynomial L_{N-1}^1(z_{k_i}).

What carries the argument

Convolution identities of the single Laguerre polynomial L_{N-1}^1(z) that rewrite traces labeled by weak compositions.

If this is right

Any trace appearing in the group-character average is rewritten as a convolution of L_{N-1}^1.
The sum rules apply without further restrictions to all weak compositions generated by the model.
The multi-matrix expression for the generalized Schur polynomial is thereby reduced to operations on a single polynomial.
Exact computations of the character averages become algebraically simpler.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The reduction may produce closed expressions for averages when the convolutions can be performed explicitly.
Similar Laguerre-based identities could appear in other random-matrix ensembles that use orthogonal polynomials.
Low-N numerical checks of the convolution formula would provide immediate verification or counter-examples.

Load-bearing premise

The convolution identities hold for arbitrary weak compositions once the matrices A_k are built from extended Laguerre polynomials.

What would settle it

Direct evaluation of a trace for small N and a concrete weak composition, then comparison with the value predicted by the Laguerre convolution formula.

read the original abstract

Average of exponential ${\rm Tr}_R e^X$, i.e. of a group rather than an algebra character, in Gaussian matrix model is known to be an amusing generalization of Schur polynomial, where time variables are substituted by traces of products of non-commuting matrices ${\rm Tr} \left(\prod_i A_{k_i}\right)$ and are thus labeled by weak compositions. The entries of matrices $A_k$ are made from extended Laguerre polynomials, what introduces additional difficulties. We describe the generic sum rules, which express arbitrary traces through convolutions of a single Laguerre polynomial $L_{N-1}^1(z_{k_i})$, what is a considerable simplification.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper claims a simplification of traces in matrix-model character averages down to convolutions of one Laguerre polynomial, but the abstract supplies no derivations so the generality remains unverified.

read the letter

The punchline is that the authors say arbitrary traces Tr(∏ A_{k_i}) reduce to convolutions of the single Laguerre L_{N-1}^1(z_{k_i}). If true, that would cut down the work when computing group-character averages in the Gaussian matrix model, where the time variables are already replaced by traces of non-commuting matrices and labeled by weak compositions. The matrices A_k themselves come from extended Laguerre polynomials, which adds the usual technical overhead. The new element is the statement of these generic sum rules; the underlying Laguerre polynomials are standard, but the convolution reduction for this setup is presented as the contribution. The paper does a clean job of framing the problem against the known Schur-polynomial generalization and naming the simplification directly. That framing is useful for anyone already inside this corner of matrix models. The soft spot is exactly what the stress-test flags: the abstract gives no explicit identity, no derivation, and no check on whether the convolutions close for every weak composition without extra conditions on the parts, their order, or on N. If the identities only hold in special cases, the “generic” claim does not stand. Until the full text shows the steps and a few concrete verifications, the central assertion stays provisional. This note is for a small group of people who already work on character averages and Laguerre techniques in hep-th and math-ph. A reader who needs to evaluate or extend these averages would get value from the reduction if the derivations check out. I would send it to referees so they can test the sum rules on explicit cases and confirm whether the simplification is as unconditional as stated.

Referee Report

2 major / 1 minor

Summary. The paper claims that the average of the group character Tr_R e^X in the Gaussian matrix model is given by a generalization of Schur polynomials in which time variables are replaced by traces Tr(∏_i A_{k_i}) labeled by weak compositions; the matrices A_k are built from extended Laguerre polynomials. It asserts the existence of generic sum rules that reduce arbitrary such traces to convolutions involving only the single Laguerre polynomial L_{N-1}^1(z_{k_i}).

Significance. If the claimed convolution identities hold unconditionally, the result would constitute a genuine technical simplification for evaluating character averages in matrix models, reducing the problem to operations on a single polynomial. This could be useful in applications to random-matrix techniques in gauge theory and string theory, especially if the identities are parameter-free and apply to all weak compositions.

major comments (2)

The central claim that arbitrary traces Tr(∏ A_{k_i}) reduce to convolutions of L_{N-1}^1(z_{k_i}) for every weak composition is load-bearing. The manuscript must supply an explicit derivation or verification of the convolution identities (including the precise definition of the convolution operation and the range of validity over compositions and N) rather than asserting their existence; without this, the generic sum-rule statement cannot be confirmed.
The construction of the matrices A_k from extended Laguerre polynomials must be shown to close under the stated convolution identities without additional restrictions on the parts k_i, their ordering, or on N. If the identities require distinct indices or a large-N limit, the asserted generality for arbitrary weak compositions is undermined.

minor comments (1)

Notation for the time variables and the precise meaning of 'convolution' should be defined at first use, preferably with a short illustrative example for a low-order weak composition.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments. The points raised correctly identify areas where additional explicit detail is required to fully substantiate the claims. We will revise the manuscript to incorporate the requested derivations and verifications.

read point-by-point responses

Referee: The central claim that arbitrary traces Tr(∏ A_{k_i}) reduce to convolutions of L_{N-1}^1(z_{k_i}) for every weak composition is load-bearing. The manuscript must supply an explicit derivation or verification of the convolution identities (including the precise definition of the convolution operation and the range of validity over compositions and N) rather than asserting their existence; without this, the generic sum-rule statement cannot be confirmed.

Authors: We agree that the manuscript currently asserts the generic sum rules without a self-contained derivation. In the revised version we will add a new subsection that derives the convolution identities from the underlying Laguerre orthogonality relations, defines the convolution explicitly as the integral ∫ L_{N-1}^1(z) L_{N-1}^1(w) K(z,w) dz dw with the appropriate kernel K, and states the precise range of validity: the identities hold for every weak composition (including repeated parts) and every finite N ≥ 1. revision: yes
Referee: The construction of the matrices A_k from extended Laguerre polynomials must be shown to close under the stated convolution identities without additional restrictions on the parts k_i, their ordering, or on N. If the identities require distinct indices or a large-N limit, the asserted generality for arbitrary weak compositions is undermined.

Authors: The extended Laguerre construction is formulated so that the matrices A_k close under the convolution for arbitrary (possibly repeated) parts k_i, any ordering, and any finite N. We will augment the revised manuscript with a general argument based on the three-term recurrence of the Laguerre polynomials together with explicit low-N checks that include repeated indices, confirming that no large-N limit or distinct-index restriction is required. revision: yes

Circularity Check

0 steps flagged

Minor self-citation on Schur generalization; central sum rules appear independently derived

full rationale

The derivation starts from the known generalization of Schur polynomials to traces over non-commuting matrices A_k built from extended Laguerre polynomials, then states generic sum rules reducing arbitrary traces to convolutions of a single L_{N-1}^1. No equation is shown to equal its own input by construction, no parameter is fitted then relabeled as prediction, and no uniqueness theorem is imported solely from the authors' prior work to force the result. The convolution identities are presented as a simplification rather than a tautology, leaving the central claim with independent content beyond the cited generalization.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The claim rests on standard properties of Laguerre polynomials and the known structure of Gaussian matrix models; no free parameters or new entities are introduced in the abstract.

axioms (1)

standard math Laguerre polynomials admit convolution identities that reduce products of traces to single-polynomial expressions
Invoked to obtain the generic sum rules for arbitrary traces

pith-pipeline@v0.9.0 · 5408 in / 1057 out tokens · 17693 ms · 2026-05-15T21:12:45.776293+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We describe the generic sum rules, which express arbitrary traces through convolutions of a single Laguerre polynomial L_{N-1}^1(z_{k_i})
IndisputableMonolith/Foundation/AlphaCoordinateFixation.lean costAlphaLog_fourth_deriv_at_zero unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

TrA(s1)…A(sm) = … ∫ dx_j e^{-s_j x_j} … L_{N-1}^1(-s_k^2 + s_k x_k - s_k x_{k-1}) …

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages · 13 internal anchors

[1]

The Euler characteristic of the moduli space of curves,

J. Harer and D. Zagier, “The Euler characteristic of the moduli space of curves,” Inventiones mathematicae85(1986) 457–486

work page 1986
[2]

Counting lattice points in the moduli space of curves

P. Norbury, “Counting lattice points in the moduli space of curves,” Mathematical Research Letters17no. 3, (2010) 467–481,arXiv:0801.4590 [math.AG]

work page internal anchor Pith review Pith/arXiv arXiv 2010
[3]

Exact 2-point function in Hermitian matrix model

A. Morozov and S. Shakirov, “Exact 2-point function in Hermitian matrix model,” JHEP12 (2009) 003,arXiv:0906.0036 [hep-th]

work page internal anchor Pith review Pith/arXiv arXiv 2009
[4]

Wilson Loops in N=4 Supersymmetric Yang--Mills Theory

J. K. Erickson, G. W. Semenoff, and K. Zarembo, “Wilson loops in N=4 supersymmetric Yang-Mills theory,” Nucl. Phys. B582(2000) 155–175,arXiv:hep-th/0003055

work page internal anchor Pith review Pith/arXiv arXiv 2000
[5]

An Exact Prediction of N=4 SUSYM Theory for String Theory

N. Drukker and D. J. Gross, “An Exact prediction of N=4 SUSYM theory for string theory,” J. Math. Phys.42(2001) 2896–2914,arXiv:hep-th/0010274

work page internal anchor Pith review Pith/arXiv arXiv 2001
[6]

Localization of gauge theory on a four-sphere and supersymmetric Wilson loops

V. Pestun, “Localization of gauge theory on a four-sphere and supersymmetric Wilson loops,” Commun. Math. Phys.313(2012) 71–129,arXiv:0712.2824 [hep-th]

work page internal anchor Pith review Pith/arXiv arXiv 2012
[7]

Combinatorics of Wilson loops inN= 4 SYM theory,

W. M¨ uck, “Combinatorics of Wilson loops inN= 4 SYM theory,” JHEP11(2019) 096, arXiv:1908.11582 [hep-th]

work page arXiv 2019
[8]

Exact 1/Nexpansion of Wilson loop correlators inN= 4 Super-Yang-Mills theory,

W. M¨ uck, “Exact 1/Nexpansion of Wilson loop correlators inN= 4 Super-Yang-Mills theory,” JHEP07(2021) 001,arXiv:2105.01003 [hep-th]. 11

work page arXiv 2021
[9]

Spectral form factor in a random matrix theory

E. Br´ ezin and S. Hikami, “Spectral form factor in a random matrix theory,” Phys. Rev. E55 (1997) 4067,arXiv:cond-mat/9608116

work page internal anchor Pith review Pith/arXiv arXiv 1997
[10]

Spectral form factor and semi-circle law in the time direction

K. Okuyama, “Spectral form factor and semi-circle law in the time direction,” JHEP02(2019) 161,arXiv:1811.09988 [hep-th]

work page internal anchor Pith review Pith/arXiv arXiv 2019
[11]

Averages of Exponentials from the point of view of Superintegrability,

A. Morozov, “Averages of Exponentials from the point of view of Superintegrability,” arXiv:2601.20213 [hep-th]

work page arXiv
[12]

Connected correlator of 1/2 BPS Wilson loops in $\mathcal{N}=4$ SYM

K. Okuyama, “Connected correlator of 1/2 BPS Wilson loops inN= 4 SYM,” JHEP10 (2018) 037,arXiv:1808.10161 [hep-th]

work page internal anchor Pith review Pith/arXiv arXiv 2018
[13]

Generating functions for intersection numbers on moduli spaces of curves

A. Okounkov, “Generating functions for intersection numbers on moduli spaces of curves,” International Mathematics Research Notices2002(2001) 933–957,arXiv:math/0101201 [math.AG]

work page internal anchor Pith review Pith/arXiv arXiv 2001
[14]

Lectures on 2D gravity and 2D string theory (TASI 1992)

P. H. Ginsparg and G. W. Moore, “Lectures on 2-D gravity and 2-D string theory,” arXiv:hep-th/9304011

work page internal anchor Pith review Pith/arXiv arXiv
[15]

Matrix models of 2-D gravity and Toda theory,

A. Gerasimov, A. Marshakov, A. Mironov, A. Morozov, and A. Orlov, “Matrix models of 2-D gravity and Toda theory,” Nucl. Phys. B357(1991) 565–618

work page 1991
[16]

Integrability and Matrix Models

A. Morozov, “Integrability and matrix models,” Phys. Usp.37(1994) 1–55, arXiv:hep-th/9303139

work page internal anchor Pith review Pith/arXiv arXiv 1994
[17]

Matrix Models as Integrable Systems

A. Morozov, “Matrix models as integrable systems,” in CRM-CAP Summer School on Particles and Fields ’94, pp. 127–210. 1, 1995.arXiv:hep-th/9502091

work page internal anchor Pith review Pith/arXiv arXiv 1995
[18]

Challenges of Matrix Models

A. Morozov, “Challenges of matrix models,” in NATO Advanced Study Institute and EC Summer School on String Theory: From Gauge Interactions to Cosmology, pp. 129–162. 2, 2005.arXiv:hep-th/0502010

work page internal anchor Pith review Pith/arXiv arXiv 2005
[19]

Integrability and Matrix Models,

A. Morozov, “Integrability and Matrix Models,”arXiv:2212.02632 [hep-th]

work page arXiv
[20]

Quantum Deformations ofτ-functions, Bilinear Identities and Representation Theory,

A. Mironov, “Quantum Deformations ofτ-functions, Bilinear Identities and Representation Theory,” Electron. Res. Announ. AMS9(1996) 219–238,arXiv:hep-th/9409190

work page arXiv 1996
[21]

I. S. Gradshteyn and I. M. Ryzhik, Table of integrals, series, and products. Academic press, 2014. 12

work page 2014