Related papers: The Spectral Edges Conjecture via Corners
An exact solution for electromagnetic wave diffraction at the junction of two-dimensional electron systems (2DES) is obtained and analyzed for electric field polarized along the edge. A special emphasis is paid to the metal-contacted and…
We consider a family of random Schr\"odinger operators on the discrete strip with decaying random $\ell^2$ matrix potential. We prove that the spectrum is almost surely pure absolutely continuous, apart from random, possibly embedded…
Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an…
A long-standing conjecture of Berge suggests that every bridgeless cubic graph can be expressed as a union of at most five perfect matchings. This conjecture trivially holds for $3$-edge-colourable cubic graphs, but remains widely open for…
Mantel's theorem is a classical result in extremal graph theory which implies that the maximum number of edges of a triangle-free graph of order $n$. In 1970, E. Nosal obtained a spectral version of Mantel's theorem which gave the maximum…
The famous Erd\H{o}s-S\'os conjecture states that every graph of average degree more than $t-1$ must contain every tree on $t+1$ vertices. In this paper, we study a spectral version of this conjecture. For $n>k$, let $S_{n,k}$ be the join…
The momentum spectrum of a periodic network (quantum graph) has a band-gap structure. We investigate the relative density of the bands or, equivalently, the probability that a randomly chosen momentum belongs to the spectrum of the periodic…
Scattering of electromagnetic waves lies at the heart of most experimental techniques over nearly the entire electromagnetic spectrum, ranging from radio waves to optics and X-rays. Hence, deep insight into the basics of scattering theory…
The paper investigates how correlations can completely specify a uniformly discrete point process. The setting is that of uniformly discrete point sets in real space for which the corresponding dynamical hull is ergodic. The first result is…
The classical spectral theorem completely describes self-adjoint operators on finite dimensional inner product vector spaces as linear combinations of orthogonal projections onto pairwise orthogonal subspaces. We prove a similar theorem for…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
It is shown that for a constant $t\in \mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the…
In this work we introduce the notion of an angular spectrum for a linear discrete time nonautonomous dynamical system. The angular spectrum comprises all accumulation points of longtime averages formed by maximal principal angles between…
Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on $n$ vertices is at most $\lfloor…
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on $n$ vertices is at most $\lfloor…
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. A bipartite graph is distance-biregular when it is…
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is…
In this tutorial paper, we consider the problem of electromagnetic scattering by a bounded two-dimensional dielectric object, and discuss certain interesting properties of the scattered field. Using the electric field integral equation,…
In this paper, we study the spectrality of infinite convolutions generated by infinitely many admissible pairs which may not be compactly supported, where the spectrality means the corresponding square integrable function space admits a…