Spectral decimation of the magnetic Laplacian on the Sierpinski gasket: Solving the Hofstadter-Sierpinski butterfly
arXiv:1909.05662 · doi:10.1007/s00220-020-03850-w
Abstract
The magnetic Laplacian (also called the line bundle Laplacian) on a connected weighted graph is a self-adjoint operator wherein the real-valued adjacency weights are replaced by unit complex-valued weights , satisfying the condition that for every directed edge . When properly interpreted, these complex weights give rise to magnetic fluxes through cycles in the graph. In this paper we establish the spectrum of the magnetic Laplacian, as a set of real numbers with multiplicities, on the Sierpinski gasket graph () where the magnetic fluxes equal through the upright triangles, and through the downright triangles. This is achieved upon showing the spectral self-similarity of the magnetic Laplacian via a 3-parameter map involving non-rational functions, which takes into account , , and the spectral parameter . In doing so we provide a quantitative answer to a question of Bellissard [Renormalization Group Analysis and Quasicrystals (1992)] on the relationship between the dynamical spectrum and the actual magnetic spectrum. Our main theorems lead to two applications. In the case , we demonstrate the approximation of the magnetic spectrum by the filled Julia set of , the Sierpinski gasket counterpart to Hofstadter's butterfly. Meanwhile, in the case , we can compute the determinant of the magnetic Laplacian determinant and the corresponding asymptotic complexity.
arXiv comment46 pages, 10 figures. Final version, to appear in Comm. Math. Phys
References in corpus (12)
- Design and characterization of electronic fractals
- Spanning trees on the Sierpinski gasket
- Spanning forests and the vector bundle Laplacian
- Topology in the Sierpiński-Hofstadter problem
- Dirac and magnetic Schrödinger operators on fractals
- Random curves on surfaces induced from the Laplacian determinant
- Sandpiles on the Sierpinski gasket
- Covariant Symanzik identities
- The looping rate and sandpile density of planar graphs
- Counting spanning trees on fractal graphs and their asymptotic complexity
- Laplacian growth & sandpiles on the Sierpinski gasket: limit shape universality and exact solutions
- Regularized Laplacian determinants of self-similar fractals