Related papers: Gaps in the spectrum of a cuboidal periodic lattic…
We consider small perturbations of the Laplace operator in a multi-dimensional cylindrical domain by second order differential operators with periodic coefficients. We show that under certain non-degeneracy conditions such perturbations can…
It is proved that small periodic singular perturbation of a cylindrical waveguide surface may open a gap in the continuous spectrum of the Dirichlet problem for the Laplace operator. If the perturbation period is long and the caverns in the…
We consider Laplace operators on periodic discrete graphs perturbed by guides, i.e., graphs which are periodic in some directions and finite in other ones. The spectrum of the Laplacian on the unperturbed graph is a union of a finite number…
We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…
The capability to temporarily arrest the propagation of optical signals is one of the main challenges hampering the ever more widespread use of light in rapid long-distance transmission as well as all-optical on-chip signal processing or…
In this paper, we consider the spectrum of a model in quantum electrodynamics with a spatial cutoff. It is proven that (1) the Hamiltonian is self-adjoint; (2) under the infrared regularity condition, the Hamiltonian has a unique ground…
We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv)…
We consider Laplacians on periodic equilateral metric graphs. The spectrum of the Laplacian consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite number of flat…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
We estimate the size of the spectral gap at zero for some Hermitian block matrices. Included are quasi-definite matrices, quasi-semidefinite matrices (the closure of the set of the quasi-definite matrices) and some related block matrices…
The notion of a band gap is ubiquitous in the characterization of matter. Particularly interesting are pseudo-gaps, which are enigmatic regions of very low density of states that have been linked to novel phenomena like high temperature…
In this paper we establish some spectral conditions for a graph to be Hamilton-connected in terms of the spectral radius of the adjacency matrix or the signless Laplacian of the graph or its complement. For the existence of Hamiltonian…
A lattice model of radiative decay (so-called spin-boson model) of a two level atom and at most two photons is considered. The location of the essential spectrum is described. For any coupling constant the finiteness of the number of…
Lattice structures play a central role in spectral graph theory, offering analytical insight into diffusion, synchronization, and transport processes on regular discrete spaces. While their spectral properties are completely characterized…
Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in $L-$alphabet and $C-$alphabet grid graphs. We also present a linear-time algorithm for finding Hamiltonian paths in these graphs.
We present experimental and numerical results for the long-range fluctuation properties in the spectra of quantum graphs with chaotic classical dynamics and preserved time-reversal invariance. Such systems are generally believed to provide…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
We show that, with very high probability, the random graph Laplacian has simple spectrum. Our method provides a quantitatively effective estimate of the spectral gaps. Along the way, we establish results on affine no-gaps delocalization,…
Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…