Recognition: unknown
Flexibility of eigenvalues for graph Laplacians arising from genus 3 surfaces
Pith reviewed 2026-05-07 12:43 UTC · model grok-4.3
The pith
The eigenvalue sets of all weighted four-vertex graph Laplacians from genus-3 pants decompositions are completely described.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We provide a complete description of the sets of eigenvalues of the weighted graph Laplacian for all graphs on four vertices that correspond to a valid pair of pants decomposition of a surface of genus 3.
What carries the argument
Weighted graph Laplacian on four-vertex graphs arising from pants decompositions, serving to approximate the small eigenvalues of the associated Riemann surface Laplacian.
If this is right
- The eigenvalue sets for each admissible four-vertex graph are explicitly determined.
- The approximation of surface eigenvalues is thereby made fully classifiable for genus 3 near the moduli space boundary.
- All valid decompositions are covered by the enumerated graphs and their associated spectra.
Where Pith is reading between the lines
- The classification supplies a base case against which uniformity of the approximation can be checked numerically for genus 3.
- It opens a route to tracking how eigenvalue sets vary under deformations that stay within the same pants decomposition type.
- Analogous exhaustive lists for other genera would reveal whether the pattern of attainable spectra is genus-dependent.
Load-bearing premise
Every valid pair of pants decomposition for a genus 3 surface yields a graph on exactly four vertices, and the known approximation result applies uniformly to all such graphs.
What would settle it
A genus 3 surface whose pants decomposition produces a graph with a different number of vertices, or whose weighted graph Laplacian eigenvalues fall outside the enumerated sets.
Figures
read the original abstract
It is known that the small eigenvalues of the Laplacian of a Riemann surface close to the boundary of the modular space can be well approximated by the eigenvalues of the discrete Laplacian on a certain graph coming from the pair of pants decomposition of the surface. In this paper, we provide a complete description of the sets of eigenvalues of the weighted graph Laplacian for all graphs on four vertices that correspond to a valid pair of pants decomposition of a surface of genus 3.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper builds on the approximation of small eigenvalues of the surface Laplacian by those of the weighted graph Laplacian associated to a pants decomposition, when the surface is near the boundary of moduli space. It claims to give a complete description of the eigenvalue sets for the weighted graph Laplacians on all 4-vertex graphs that arise from valid pants decompositions of genus-3 surfaces.
Significance. If the enumeration of admissible graphs is exhaustive and the eigenvalue computations are accurate, the result supplies an explicit list of all possible small-eigenvalue configurations realizable by genus-3 surfaces with short geodesics. This is a concrete, low-genus case that could serve as a benchmark for higher-genus extensions and for numerical checks of the continuous-to-discrete approximation.
major comments (2)
- [Section 3 and Theorem 1.1] The central claim of completeness rests on the assertion that every pants decomposition of a genus-3 surface yields a graph on exactly four vertices and that the listed graphs exhaust all topologically distinct realizations (including possible multiple edges or loops arising from different cuff gluings). No classification theorem or exhaustive case-by-case argument is supplied to rule out additional 4-vertex multigraphs that still correspond to hyperbolic metrics with arbitrarily short cuffs; this directly affects whether the described eigenvalue sets are truly exhaustive.
- [§2.3 and the paragraph after Eq. (2.3)] The application of the known approximation result is stated to hold uniformly for the enumerated graphs, but the paper does not verify that the required conditions on cuff lengths (e.g., all cuffs short simultaneously) are satisfied for every listed graph without additional restrictions on the weight vector; see the statement following Equation (2.3).
minor comments (2)
- [§2] The notation for the weighted adjacency matrix and the precise definition of the graph Laplacian should be recalled explicitly in §2 rather than only referenced to an earlier paper.
- [Figure 1] Figure 1 would benefit from explicit labels indicating which edges correspond to which cuffs and which vertices to which pants.
Simulated Author's Rebuttal
We thank the referee for their careful reading and constructive comments. We address the major comments point by point below and have revised the manuscript to incorporate clarifications and additional justification where needed.
read point-by-point responses
-
Referee: [Section 3 and Theorem 1.1] The central claim of completeness rests on the assertion that every pants decomposition of a genus-3 surface yields a graph on exactly four vertices and that the listed graphs exhaust all topologically distinct realizations (including possible multiple edges or loops arising from different cuff gluings). No classification theorem or exhaustive case-by-case argument is supplied to rule out additional 4-vertex multigraphs that still correspond to hyperbolic metrics with arbitrarily short cuffs; this directly affects whether the described eigenvalue sets are truly exhaustive.
Authors: We appreciate the referee's observation. The enumeration in the manuscript is based on the standard fact that a pants decomposition of a genus-3 surface consists of exactly six curves, yielding a dual graph with four vertices and six edges (allowing loops and multiple edges). However, we agree that an explicit verification ruling out other 4-vertex multigraphs was not provided. In the revised version, we will add a subsection to Section 3 with a case-by-case classification of all possible pants decompositions on genus-3 surfaces, confirming that the listed graphs are exhaustive and that no additional admissible 4-vertex multigraphs exist. revision: yes
-
Referee: [§2.3 and the paragraph after Eq. (2.3)] The application of the known approximation result is stated to hold uniformly for the enumerated graphs, but the paper does not verify that the required conditions on cuff lengths (e.g., all cuffs short simultaneously) are satisfied for every listed graph without additional restrictions on the weight vector; see the statement following Equation (2.3).
Authors: The referee is correct that the approximation requires all cuff lengths to be short simultaneously. For each of the enumerated graphs, the corresponding pants decomposition admits Fenchel-Nielsen coordinates in which all six cuff lengths can be taken arbitrarily small at once. Thus the uniform approximation applies to all listed graphs with no further restrictions on the weight vector beyond the standard small-length assumption. We will insert a clarifying remark immediately after Equation (2.3) to make this explicit for every graph in the list. revision: yes
Circularity Check
No circularity; classification and eigenvalue description are independent of inputs.
full rationale
The paper starts from an external known approximation result relating small eigenvalues of Riemann surfaces (near moduli space boundary) to discrete weighted graph Laplacians arising from pants decompositions. It then enumerates all 4-vertex graphs that realize valid genus-3 pants decompositions and computes their eigenvalue sets explicitly. No step reduces by definition to its own output (no self-definitional loops), no fitted parameter is relabeled as a prediction, and the central completeness claim rests on combinatorial enumeration rather than a self-citation chain or ansatz smuggled from prior author work. The derivation chain is therefore self-contained against external benchmarks and receives the default non-circularity finding.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Small eigenvalues of the surface Laplacian near the boundary of moduli space are approximated by those of the discrete graph Laplacian from the pants decomposition.
Reference graph
Works this paper leans on
-
[1]
[AM23] Nalini Anantharaman and Laura Monk. Friedman-Ramanujan functions in random hyperbolic geometry and application to spectral gaps.arXiv:2304.02678,
-
[2]
[AM25] Nalini Anantharaman and Laura Monk. Friedman-Ramanujan functions in random hyperbolic geometry and application to spectral gaps II.arXiv:2502.12268,
-
[3]
[CFGL26] Minerva Catral, Shaun Fallat, Himanshu Gupta, and Jephian C-H Lin. The strong spectral property and the jacobian method for weighted laplacian matrices.arXiv:2602.18999v1,
-
[4]
Two counterexamples to a conjecture of colin de verdi` ere on multiplicity.arXiv:2312.03504,
[FBGMPP23] Maxime Fortier Bourque, ´Emile Gruda-Mediavilla, Bram Petri, and Mathieu Pineault. Two counterexamples to a conjecture of colin de verdi` ere on multiplicity.arXiv:2312.03504,
-
[5]
Linear programming bounds for hyperbolic surfaces
[FBP23] Maxime Fortier Bourque and Bram Petri. Linear programming bounds for hyperbolic surfaces. arXiv:2302.02540,
-
[6]
Spectral gap with polynomial rate for random covering surfaces.arXiv:2505.08479,
[HMT25] Will Hide, David Macera, and Joe Thomas. Spectral gap with polynomial rate for random covering surfaces.arXiv:2505.08479,
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.