The Creation of Spectral Gaps by Graph Decoration
classification
🧮 math-ph
cond-matmath.MPmath.SP
keywords
graphcreationdecorationgapsamplitudesassociatedbottleneckcertain
read the original abstract
We present a mechanism for the creation of gaps in the spectra of self-adjoint operators defined over a Hilbert space of functions on a graph, which is based on the process of graph decoration. The resulting Hamiltonians can be viewed as associated with discrete models exhibiting a repeated local structure and a certain bottleneck in the hopping amplitudes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.