Related papers: Rare Flat Bands for Periodic Graph Operators
We report the theoretical discovery of a large class of 2D tight-binding models containing nearly-flat bands with nonzero Chern numbers. In contrast with previous studies, where nonlocal hoppings are usually required, the Hamiltonians of…
We discuss the analytic properties of AdS scalar exchange graphs in the crossed channel. We show that the possible non-analytic terms drop out by virtue of non-trivial properties of generalized hypergeometric functions. The absence of…
We address the question of convergence of Schr\"odinger operators on metric graphs with general self-adjoint vertex conditions as lengths of some of graph's edges shrink to zero. We determine the limiting operator and study convergence in a…
Recently there is trend to study topological properties in one-dimensional(1D) periodic systems. Concepts such as Zak phase are considered as topological invariants that characterize the bulk bands. The bulk 1D systems are classified to…
Ordinary differential operators with periodic coefficients analytic in a strip act on a Hardy-Hilbert space of analytic functions with inner product defined by integration over a period on the boundary of the strip. Simple examples show…
We consider the unperturbed operator $H_0: = (-i \nabla - {\bf A})^2 + W$, self-adjoint in $L^2({\mathbb R}^2)$. Here ${\bf A}$ is a magnetic potential which generates a constant magnetic field $b>0$, and the edge potential $W = \bar{W}$ is…
A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a…
Every link is shown to be presentable as a boundary of an unknotted flat banded surface. A (flat) banded link is defined as a boundary of an unknotted (flat) banded surface. A link's (flat) band index is defined as the minimum number of…
We study the spectrum of a periodic self-adjoint operator on the axis perturbed by a small localized nonself-adjoint operator. It is shown that the continuous spectrum is independent of the perturbation, the residual spectrum is empty, and…
A bipartite lattice with chiral symmetry is known to host zero energy flat bands if the numbers of the two sublattices are different. We demonstrate that this mechanism of producing flat bands can be realized on graphene by introducing…
We consider tight-binding models on Bravais lattices with anisotropic onsite potentials that vary along a given direction and are constant along the transverse one. Inspired by our previous work on flat bands in anti-\(\mathcal{PT}\)…
A flat band can be studied an infinitely strong coupling, realized in a simple system. Therefore, its holographic realization should be interesting. Laia and Tong gave a realization of the flat band over the entire momentum region by…
A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…
We have proposed a semiclassical explanation of the geometric structure of the spectrum for the two-dimensional Landau Hamiltonian with a two-periodic electric field without any additional assumptions on the potential. Applying an iterative…
We complete the analysis of the band functions for two-dimensional magnetic Schr\"odinger operators with piecewise constant magnetic fields. The discontinuity of the magnetic field can create edge currents that ow along the discontinuity…
We study the problem of minimizing or maximizing the fundamental spectral gap of Schr\"odinger operators on metric graphs with either a convex potential or a ``single-well'' potential on an appropriate specified subset. (In the case of…
The minimal infinitesimal rigidity of bar-joint frameworks in the non-Euclidean spaces (R^2, ||.||_q) are characterised in terms of (2,2)-tight graphs. Specifically, a generically placed bar-joint framework (G,p) in the plane is minimally…
Let $G$ be a connected graph with the usual shortest-path metric $d$. The graph $G$ is $\delta$-hyperbolic provided for any vertices $x,y,u,v$ in it, the two larger of the three sums $d(u,v)+d(x,y),d(u,x)+d(v,y)$ and $d(u,y)+d(v,x)$ differ…
A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.…
Connectivity is a central notion of graph theory and plays an important role in graph algorithm design and applications. With emerging new applications in networks, a new type of graph connectivity problem has been getting more…