Related papers: Bounded quantifier depth spectrum for random unifo…
We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs.…
In 1986, Brualdi and Solheid firstly proposed the problem of determining the maximum spectral radius of graphs in the set $\mathcal{H}_{n,m}$ consisting of all simple connected graphs with $n$ vertices and $m$ edges, which is a very tough…
In this paper we exploit the phenomenon of two principal half eigenvalues in the context of fully nonlinear Lane-Emden type systems with possibly unbounded coefficients and weights. We show that this gives rise to the existence of two…
We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…
We introduce compactness classes of Hilbert space operators by grouping together all operators for which the associated singular values decay at a certain speed and establish upper bounds for the norm of the resolvent of operators belonging…
Several new spectral properties of the normalized Laplacian defined for oriented hypergraphs are shown. The eigenvalue $1$ and the case of duplicate vertices are discussed; two Courant nodal domain theorems are established; new quantities…
Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…
We establish that unitarity of scattering amplitudes imposes universal entropy bounds. The maximal entropy of a self-sustained quantum field object of radius R is equal to its surface area and at the same time to the inverse running…
The paper is concerned with the number of open gaps in spectra of periodic quantum graphs. The well-known conjecture by Bethe and Sommerfeld (1933) says that the number of open spectral gaps for a system periodic in more than one direction…
In this paper, we give upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and characterize the equality cases. These bounds theoretically improve and generalize some known results of Duan et al.[X. Duan, B.…
An equivalent definition of entropic Ricci curvature on discrete spaces was given in terms of the global gradient estimate. With a particular choice of the density function $\rho$, we obtain a localized gradient estimate, which in turns…
Sufficient conditions for a discrete spectrum of the biharmonic equation in a two-dimensional peak-shaped domain are established. Different boundary conditions from Kirchhoff's plate theory are imposed on the boundary and the results depend…
A recent development in random matrix theory, the intrinsic freeness principle, establishes that the spectrum of very general random matrices behaves as that of an associated free operator. This reduces the study of such random matrices to…
This work explores the spectra of quantum graphs where the Schr\"odinger operator on the edges is equipped with a potential. The scattering approach, which was originally introduced for the potential free case, is extended to this case and…
In Part I we construct the upper bound, in the spirit of $\Gamma$- $\limsup$, achieved by multidimensional profiles, for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking…
We study the problem of maximizing the $k$-th eigenvalue functional over the class of absolutely continuous measures on a closed Riemannian manifold of dimension $m\geq 3$. For dimensions $3 \leq m \leq 6$, we generalize the work of…
We show various upper bounds for the order of a digraph (or a mixed graph) whose Hermitian adjacency matrix has an eigenspace of prescribed codimension. In particular, this generalizes the so-called absolute bound for (simple) graphs first…
We investigate Ramsey numbers of bounded degree graphs and provide an interpolation between known results on the Ramsey numbers of general bounded degree graphs and bounded degree graphs of small bandwidth. Our main theorem implies that…
A method for estimating the spectral gap along with higher eigenvalues of nonequilateral quantum graphs has been introduced by Amini and Cohen-Steiner recently: it is based on a new transference principle between discrete and continuous…
We consider a random quantum channel obtained by taking a selection of $d$ independent and Haar distributed $N$ dimensional unitaries. We follow the argument of Hastings to bound the spectral gap in terms of eigenvalues and adapt it to give…