Finite graphs define spectral curves that converge to stable curves in the continuum limit, connecting to topological recursion and replacing BKL singularities with nodal chains of rational curves whose entropy derives from automorphism groups.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
From Graph Laplacians to String Partition Functions: A Rigorous Pathway from Discrete Spectra to Emergent Geometry
Finite graphs define spectral curves that converge to stable curves in the continuum limit, connecting to topological recursion and replacing BKL singularities with nodal chains of rational curves whose entropy derives from automorphism groups.