Papers
Topics
Authors
Recent
Search
2000 character limit reached

Kagome network with vertex coupling of a preferred orientation

Published 30 Jun 2021 in math-ph, math.MP, math.SP, and quant-ph | (2106.16019v1)

Abstract: We investigate spectral properties of periodic quantum graphs in the form of a kagome or a triangular lattice in the situation when the condition matching the wave functions at the lattice vertices is chosen of a particular form violating the time-reversal invariance. The positive spectrum consists of infinite number of bands, some of which may be flat; the negative one has at most three and two bands, respectively. The kagome lattice example shows that even in graphs with such an uncommon vertex coupling spectral universality may hold: if its edges are incommensurate, the probability that a randomly chosen positive number is contained in the spectrum is $\approx 0.639$.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.