Related papers: Sharp eigenvalue bounds on quantum star graphs

In this paper, we give tight bounds for the normalized Laplacian eigenvalues of hypergraphs that are not necessarily uniform, and provide an edge version interlacing theorem, a Cheeger inequality, and a discrepancy inequality that are…

We study sharp $p$-variational inequalities for the Hardy-Littlewood maximal operator on complete graphs, answering in the affirmative a question by Feng Liu and Qingying Xue. We also use computational assistance to find sharp constants in…

We prove that the maximum eigenvalue of the (both signed and unsigned) Laplacian of level $k$ Kikuchi graph of any graph $G$ with $m$ edges is at most $m+k$. This confirms four recent conjectures of Apte, Parekh, and Sud. As applications,…

Let $G$ be a graph and let $g, f$ be nonnegative integer-valued functions defined on $V(G)$ such that $g(v) \le f(v)$ and $g(v) \equiv f(v) \pmod{2}$ for all $v \in V(G)$. A $(g,f)$-parity factor of $G$ is a spanning subgraph $H$ such that…

We investigate analytic and geometric implications of non-constant Ricci curvature bounds. We prove a Lichnerowicz eigenvalue estimate and finiteness of the fundamental group assuming that $L+2 Ric$ is a positive operator where $L$ is the…

We consider a sparse random subraph of the $n$-cube where each edge appears independently with small probability $p(n) =O(n^{-1+o(1)})$. In the most interesting regime when $p(n)$ is not exponentially small we prove that the largest…

We derive an optimal eigenvalue ratio estimate for finite weighted graphs satisfying the curvature-dimension inequality $CD(0,\infty)$. This estimate is independent of the size of the graph and provides a general method to obtain higher…

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…

We prove that for every integer $d \ge 3$, the median eigenvalues of any graph of maximum degree $d$ are bounded above by $\sqrt{d-1}$. We also prove that, in three separate cases, the median eigenvalues of a graph of maximum degree $d$ are…

We show several variants of concentration inequalities on the sphere stated as subgaussian estimates with optimal constants. For a Lipschitz function, we give one-sided and two-sided bounds for deviation from the median as well as from the…

This paper is devoted to providing quantitative bounds on the location of eigenvalues, both discrete and embedded, of non self-adjoint Lam\'e operators of elasticity $-\Delta^\ast + V$ in terms of suitable norms of the potential $V$. In…

By the Aharonov-Casher theorem, the Pauli operator $P$ has no zero eigenvalue when the normalized magnetic flux $\alpha$ satisfies $|\alpha|<1$, but it does have a zero energy resonance. We prove that in this case a Lieb-Thirring inequality…

We study the eigenvalues of the unique connected anti-regular graph $A_n$. Using Chebyshev polynomials of the second kind, we obtain a trigonometric equation whose roots are the eigenvalues and perform elementary analysis to obtain an…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

The limit distribution of the discrete spectrum of the Sturm-Liouville problem with complex-valued polynomial potential on an interval, on a half-axis, and on the entire axis is studied. It is shown that at large parameter values, the…

An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for each vertex $v \in V(G)$, $d_H(v)$ is odd and $1\le d_H(v) \le b$. Let $\lambda_3(G)$ be the third largest eigenvalue of the adjacency matrix of $G$. For positive…

We prove \emph{optimal} improvements of the Hardy inequality on the hyperbolic space. Here, optimal means that the resulting operator is critical in the sense of [J.Funct.Anal. 266 (2014), pp. 4422-89], namely the associated inequality…

We introduce a graph $\Gamma$ which is roughly isometric to the hyperbolic plane and we study the Steklov eigenvalues of a subgraph with boundary $\Omega$ of $\Gamma$. For $(\Omega_l)_{l\geq 1}$ a sequence of subraphs of $\Gamma$ such that…

We study positive solutions of the superlinear Lane-Emden inequality \(-\Delta u\ge \sigma u^q\), \(q>1\), on infinite locally finite weighted graphs and connected domains of such graphs. We first prove that solvability is equivalent to the…

The spectral radius {\rho}(G) of a digraph G is the maximum modulus of the eigenvalues of its adjacency matrix. We present bounds on {\rho}(G) that are often tighter and are applicable to a larger class of digraphs than previously reported…