Related papers: Sharp diameter bound on the spectral gap for quant…
The spectral analogue of the Tur\'{a}n type problem for hypergraphs is to determine the maximum spectral radius for the hypergraphs of order $n$ that do not contain a given hypergraph. For the hypergraphs among the set of the connected…
A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…
We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are…
We consider the gap creation problem in an antidot graphene lattice, i.e. a sheet of graphene with periodically distributed obstacles. We prove several spectral results concerning the size of the gap and its dependence on different natural…
In this paper, we extend the sharp lower bounds of spectal gap, due to Chen- Wang [10, 11], Bakry-Qian [6] and Andrews-Clutterbuck [5], from smooth Riemaniannian manifolds to general metric measure spaces with Riemannian curvature-dimension…
The transmission spectrum of a high-finesse optical cavity containing an arbitrary number of trapped atoms is presented. We take spatial and motional effects into account and show that in the limit of strong coupling, the important spectral…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
We derive a lower bound to the spectral threshold of the Dirichlet Laplacian in tubular neighbourhoods of constant radius about complete surfaces. This lower bound is given by the lowest eigenvalue of a one-dimensional operator depending on…
In this paper, we give upper estimates for the number and sum of eigenvalues below the bottom of the essential spectrum counting multiplicities of quantum waveguides in two dimensions. We consider both straight and curved waveguides of…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…
For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which…
We prove upper and lower bounds on the size of the largest square grid graph that is a subgraph, minor, or shallow minor of a graph in the form of a larger square grid from which a specified number of vertices have been deleted. Our bounds…
In this paper, we derive new sharp diameter bounds for distance regular graphs, which better answer a problem raised by Neumaier and Penji\' c in many cases. Our proof is built upon a relation between the diameter and long-scale Ollivier…
The electronic states of an electrostatically confined cylindrical graphene quantum dot and the electric transport through this device are studied theoretically within the continuum Dirac-equation approximation and compared with numerical…
In this article, we derive two spectral gap bounds for the reduced Laplacian of a general simplicial complex. Our two bounds are proven by comparing a simplicial complex in two different ways with a larger complex and with the corresponding…
Following recent work by Koll\'{a}r and Sarnak, we study gaps in the spectra of large connected cubic and quartic graphs with minimum spectral gap. We focus on two sequences of graphs, denoted $\Delta_n$ and $\Gamma_n$ which are more…
The existence of a strong spectral gap for lattices in semi-simple Lie groups is crucial in many applications. In particular, for arithmetic lattices it is useful to have bounds for the strong spectral gap that are uniform in the family of…
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…
We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the S-matrix for all energies in any given open set…
We consider a non-compact Riemannian periodic manifold such that the corresponding Laplacian has a spectral gap. By continuously perturbing the periodic metric locally we can prove the existence of eigenvalues in a gap. A lower bound on the…