Optimal Algorithms for Quantifying Spectral Size with Applications to Quasicrystals
Matthew J. Colbrook, Mark Embree, Jake Fillman

TL;DR
This paper develops optimal algorithms to measure the spectral size of operators, especially in quasicrystal models, using various metrics, and explores their theoretical limits and practical computations.
Contribution
It introduces computational strategies and proves their optimality for spectral analysis of almost-periodic operators, bridging theory and practical applications.
Findings
Algorithms are proven optimal via lower bounds.
State-of-the-art computations effectively capture complex spectra.
Provides a rigorous framework connecting spectral theory and computation.
Abstract
We introduce computational strategies for measuring the ``size'' of the spectrum of bounded self-adjoint operators using various metrics such as the Lebesgue measure, fractal dimensions, the number of connected components (or gaps), and other spectral characteristics. Our motivation comes from the study of almost-periodic operators, particularly those that arise as models of quasicrystals. Such operators are known for intricate hierarchical patterns and often display delicate spectral properties, such as Cantor spectra, which are significant in studying quantum mechanical systems and materials science. We propose a series of algorithms that compute these properties under different assumptions and explore their theoretical implications through the Solvability Complexity Index (SCI) hierarchy. This approach provides a rigorous framework for understanding the computational feasibility of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuasicrystal Structures and Properties · Phase-change materials and chalcogenides
