arXiv · 2611.19723
Thouless's bandwidth conjecture: a proof by elliptic periods
Abstract
We prove Thouless's bandwidth conjecture for the critical rational Harper operator: the denominator times the total bandwidth tends to $32G/π$, uniformly in the reduced numerator, where $G$ is Catalan's constant. We identify a universal limit of the normalized even coarea density. Positive real part and evenness give an integrable endpoint bound, so the local law determines the bandwidth. An exact finite-matrix formula reduces the local law to one normalized period for each fixed odd numerator. Explicit boundary polynomials, point blowups, and intersections determine a compact genus-one family. Nodal-annulus calculations fix its period equation and hence the universal density. An exact rational Fourier identity and uniform closed-path bounds extend the result to all reduced numerators and both denominator parities. The singular matrix limit, including its subtraction and normalization, is proved separately in detail.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yongqiang Zhao. 2026-11-15. Thouless's bandwidth conjecture: a proof by elliptic periods. https://searcharxiv.com/abs/2611.19723
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.