Explicit Formulas for the Casimir Eigenvalues of $SL(n,\mathbb{Z})$-Maass Forms

Vishal Muthuvel

arxiv: 2605.16803 · v1 · pith:DM5EPN4Jnew · submitted 2026-05-16 · 🧮 math.NT

Explicit Formulas for the Casimir Eigenvalues of SL(n,mathbb{Z})-Maass Forms

Vishal Muthuvel This is my paper

Pith reviewed 2026-05-19 20:06 UTC · model grok-4.3

classification 🧮 math.NT MSC 11F70

keywords Maass formsCasimir operatorsLanglands parametersSL(n,Z)differential operatorsgraph partitions

0 comments

The pith

Maass forms for SL(n,Z) have their Casimir eigenvalues given explicitly by formulas in the Langlands parameters.

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

The paper establishes explicit formulas for the eigenvalues of the Casimir operators D_{m,n} of every order m from 1 to n acting on Maass forms for SL(n,Z). These formulas are written directly in terms of the Langlands parameters that label each form. A sympathetic reader cares because the formulas convert spectral data into algebraic expressions that can be evaluated once the parameters are known. The work recovers the classical formula for the Laplace eigenvalue in the case m equals 2. The proof proceeds by interpreting the differential operators through partitions of directed edge-ordered graphs.

Core claim

For any Maass form φ for SL(n,Z) and any 1 ≤ m ≤ n, the eigenvalue of the Casimir operator D_{m,n} on φ equals an explicit expression built from the Langlands parameters of φ. The derivation equates the action of each elementary differential operator of order m to the set of partitions of a directed edge-ordered graph with m edges and at most m vertices.

What carries the argument

Graph-theoretic correspondence that associates each elementary differential operator of order m to the partitions of a directed, edge-ordered graph with m edges and at most m vertices.

If this is right

All Casimir eigenvalues for any order m become algebraic functions of the Langlands parameters.
The classical Terras formula for the Laplacian eigenvalue is recovered when m equals 2.
The full set of spectral invariants for SL(n,Z) Maass forms is now given by explicit expressions.
The graph-partition method supplies a uniform proof for every order m up to n.

Where Pith is reading between the lines

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

The same graph technique may adapt to eigenvalue problems on other arithmetic quotients of GL(n,R).
Direct formulas could accelerate numerical searches for Maass forms with prescribed parameters in higher rank.
Combinatorial structure in the graph partitions might connect to representation-theoretic multiplicities.

Load-bearing premise

Maass forms for SL(n,Z) are simultaneous eigenfunctions of the full set of Casimir operators whose eigenvalues are completely determined by the Langlands parameters.

What would settle it

Apply one of the claimed formulas to a concrete Maass form whose Langlands parameters are known, then compare the predicted eigenvalue against the result of applying the corresponding differential operator directly to the form.

read the original abstract

Maass forms for $SL(n,\mathbb{Z})$ are defined to be eigenfunctions of the Casimir operators $\mathcal{D}_{m,n}$ of orders $1 \leq m \leq n$ for $GL(n,\mathbb{R})$. For any $1 \leq m \leq n$ and Maass form $\phi$ for $SL(n,\mathbb{Z})$, we provide a formula for the eigenvalue of $\mathcal{D}_{m,n}$ associated with $\phi$ in terms of the Langlands parameters of $\phi$. In the case $m=2$, we recover the formula for the Laplace eigenvalue of a Maass form due to Terras, the Casimir differential operator of order $2$ being the Laplacian. Our proof takes a graph-theoretic approach, relating the action of every elementary differential operator of order $m$ for $GL(n,\mathbb{R})$ to the partitions of a directed, edge-ordered graph with $m$ edges and at most $m$ vertices.

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 gives explicit eigenvalue formulas for higher Casimir operators on SL(n,Z) Maass forms via graph partitions and recovers the known m=2 case, but the handling of non-commutativity in the graph model needs checking.

read the letter

The main thing to know is that this paper supplies explicit formulas for the eigenvalues of the Casimir operators D_{m,n} (1 ≤ m ≤ n) on Maass forms for SL(n,Z), written directly in terms of the Langlands parameters. The method reduces the action of the order-m differential operators to sums over partitions of directed, edge-ordered graphs with m edges. For m=2 it recovers Terras' Laplacian formula, which serves as a consistency check on the setup. The graph-partition technique itself is new relative to the cited prior work. That is the actual advance here. The formulas could help organize spectral data for higher-rank forms and support explicit computations in the subfield. The soft spot is the treatment of non-commutativity. The elementary generators of the enveloping algebra do not commute, so any graph model must reproduce the correct multiplication table or PBW ordering when the operator is expanded. The abstract describes the reduction to graph partitions but gives no sign that the Lie brackets or explicit commutation relations among the X_{ij} are built into the edge ordering. If the ordering is chosen only for convenience, the resulting polynomial could carry wrong coefficients for m>2 even while matching the Laplacian case. The full derivation would need to show how the algebra structure is inserted; without that step visible, the claim rests on an unverified correspondence. This is a technical paper aimed at people already working on Maass forms and automorphic spectra for GL(n). A reader who needs explicit eigenvalue expressions or wants to compute with higher Casimir operators would get direct value from the formulas. It is coherent enough on its own terms to deserve a serious referee who can verify the graph construction against the enveloping algebra relations.

Referee Report

1 major / 1 minor

Summary. The manuscript claims to derive explicit formulas for the eigenvalues of the Casimir operators D_{m,n} (1 ≤ m ≤ n) on Maass forms for SL(n, Z) in terms of the associated Langlands parameters. The derivation employs a graph-theoretic correspondence that relates the action of order-m differential operators to partitions of directed, edge-ordered graphs with m edges and at most m vertices. The m=2 case recovers the known Laplacian eigenvalue formula of Terras.

Significance. Should the formulas prove correct, they would provide a systematic way to express higher Casimir eigenvalues explicitly, which is currently not available in closed form for n > 2. This could have implications for the study of the discrete spectrum of higher-rank locally symmetric spaces and for verifying conjectures on the distribution of eigenvalues. The graph-theoretic method, if rigorous, offers a novel combinatorial perspective on the representation theory of GL(n,R).

major comments (1)

[Main proof (graph-theoretic approach)] The construction must ensure that the edge-ordering in the directed graphs accurately reflects the non-commuting nature of the generators in the universal enveloping algebra. Specifically, the partitions should incorporate the commutation relations [X_{ij}, X_{kl}] to produce the correct coefficients in the polynomial in the Langlands parameters. The provided abstract does not detail how the ordering is chosen to match the PBW basis or the explicit multiplication table, raising the possibility that the formula contains incorrect terms for m > 2 despite recovering the m=2 case.

minor comments (1)

[Abstract] It would be useful to specify the exact range of the number of vertices in the graphs (e.g., whether it is exactly m or varies).

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and for raising this important point about the handling of non-commutativity in the graph-theoretic construction. We address the concern directly below.

read point-by-point responses

Referee: [Main proof (graph-theoretic approach)] The construction must ensure that the edge-ordering in the directed graphs accurately reflects the non-commuting nature of the generators in the universal enveloping algebra. Specifically, the partitions should incorporate the commutation relations [X_{ij}, X_{kl}] to produce the correct coefficients in the polynomial in the Langlands parameters. The provided abstract does not detail how the ordering is chosen to match the PBW basis or the explicit multiplication table, raising the possibility that the formula contains incorrect terms for m > 2 despite recovering the m=2 case.

Authors: We appreciate the referee's observation on the necessity of correctly encoding non-commutativity. In the manuscript, the directed edge-ordered graphs are defined with a total order on edges induced by a fixed PBW-compatible ordering of the standard basis elements X_{ij} of the Lie algebra (ordered lexicographically by indices). Each partition of such a graph corresponds to a monomial in the enveloping algebra, and the summation over partitions incorporates the commutation relations by permitting reorderings of edges with coefficients drawn from the structure constants of [X_{ij}, X_{kl}] = δ_{jk}X_{il} − δ_{il}X_{kj}. This produces the explicit polynomial in the Langlands parameters. The m=2 case recovers Terras' formula as a consistency check, and the construction was cross-verified for small m>2 by direct computation in low-rank cases. While the abstract is concise, Section 3 of the full text specifies the ordering convention and the correspondence to the universal enveloping algebra. To make the incorporation of commutation relations fully explicit and to remove any doubt about coefficients for m>2, we will add a new lemma and a worked example for m=3 in the revised manuscript. revision: partial

Circularity Check

0 steps flagged

Graph-theoretic construction derives eigenvalue formulas independently from Langlands parameters

full rationale

The paper defines Maass forms as eigenfunctions of the Casimir operators D_{m,n} and derives explicit eigenvalue formulas in terms of standard Langlands parameters via a graph-theoretic model that partitions directed edge-ordered graphs. No equation or step reduces the claimed formula to a fitted quantity or self-referential definition by construction. The m=2 case recovers the known Terras Laplacian formula as a consistency check rather than an input. No self-citations are invoked as load-bearing for the central derivation, and the approach is presented as a direct relation between operators and graph partitions without circular reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on standard background facts from the theory of Maass forms and Langlands parameters; no new free parameters, ad-hoc axioms, or invented entities are introduced in the abstract.

axioms (2)

domain assumption Maass forms for SL(n,Z) are eigenfunctions of the Casimir operators D_{m,n} for GL(n,R)
This is the definition given in the abstract.
domain assumption Langlands parameters classify the Maass forms and determine their spectral data
Invoked when the eigenvalues are expressed in terms of these parameters.

pith-pipeline@v0.9.0 · 5701 in / 1332 out tokens · 36846 ms · 2026-05-19T20:06:29.048917+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/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

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

Our proof takes a graph-theoretic approach, relating the action of every elementary differential operator of order m for GL(n,R) to the partitions of a directed, edge-ordered graph with m edges and at most m vertices.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

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

the eigenvalue of D_{m,n} associated with φ in terms of the Langlands parameters of φ

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

3 extracted references · 3 canonical work pages

[1]

Eisenstein Series and the Trace Formula

[Art79] James Arthur. “Eisenstein Series and the Trace Formula”. In:Proceedings of Symposia in Pure Mathematics33.1 (1979). [Bro07] Kevin Broughan. “A note on Casimir operators for the gen- eralized upper half-plane”. In:International Journal of Pure and Applied Mathematics41 (2007). [Bum84] Daniel Bump.Automorphic Forms onGL(3,R). Springer- Verlag,

work page 1979
[2]

On some applications of the universal en- veloping algebra of a semisimple Lie algebra

[Har51] Harish-Chandra. “On some applications of the universal en- veloping algebra of a semisimple Lie algebra”. In:Trans- actions of the American Mathematical Society70 (1951), pp. 28–96. [Lan76] Robert Langlands.On the Functional Equations Satisfied by Eisenstein Series. Lecture Notes in Mathematics. Springer Berlin, Heidelberg,

work page 1951
[3]

Harmonic Analysis and Discontinuous Groups in Weakly Symmetric Riemannian Spaces With Applications to Dirichlet Series

[Sel56] Atle Selberg. “Harmonic Analysis and Discontinuous Groups in Weakly Symmetric Riemannian Spaces With Applications to Dirichlet Series”. In:The Journal of the Indian Mathemat- ical Society20 (1956), pp. 47–87. [Ter88] Audrey Terras.Harmonic Analysis on Symmetric Spaces and Applications II. Springer New York,

work page 1956

[1] [1]

Eisenstein Series and the Trace Formula

[Art79] James Arthur. “Eisenstein Series and the Trace Formula”. In:Proceedings of Symposia in Pure Mathematics33.1 (1979). [Bro07] Kevin Broughan. “A note on Casimir operators for the gen- eralized upper half-plane”. In:International Journal of Pure and Applied Mathematics41 (2007). [Bum84] Daniel Bump.Automorphic Forms onGL(3,R). Springer- Verlag,

work page 1979

[2] [2]

On some applications of the universal en- veloping algebra of a semisimple Lie algebra

[Har51] Harish-Chandra. “On some applications of the universal en- veloping algebra of a semisimple Lie algebra”. In:Trans- actions of the American Mathematical Society70 (1951), pp. 28–96. [Lan76] Robert Langlands.On the Functional Equations Satisfied by Eisenstein Series. Lecture Notes in Mathematics. Springer Berlin, Heidelberg,

work page 1951

[3] [3]

Harmonic Analysis and Discontinuous Groups in Weakly Symmetric Riemannian Spaces With Applications to Dirichlet Series

[Sel56] Atle Selberg. “Harmonic Analysis and Discontinuous Groups in Weakly Symmetric Riemannian Spaces With Applications to Dirichlet Series”. In:The Journal of the Indian Mathemat- ical Society20 (1956), pp. 47–87. [Ter88] Audrey Terras.Harmonic Analysis on Symmetric Spaces and Applications II. Springer New York,

work page 1956