相关论文: A Faber--Krahn inequality for trees

The classical isodiametric inequality in the Euclidean space says that balls maximize the volume among all sets with a given diameter. We consider in this paper the case of Carnot groups. We prove that for any Carnot group equipped with a…

In this paper, we study the shape optimization problem for the first eigenvalue of the $p$-Laplace operator with the mixed Neumann-Dirichlet boundary conditions on multiply-connected domains in hyperbolic space. Precisely, we establish that…

We prove the Fundamental Gap Conjecture, which states that the difference between the first two Dirichlet eigenvalues (the spectral gap) of a Schr\"odinger operator with convex potential and Dirichlet boundary data on a convex domain is…

The notion of tamed Dirichlet space by distributional lower Ricci curvature bounds was proposed by Erbar--Rigoni--Sturm--Tamanini as the Dirichlet space having a weak form of Bakry--\'Emery curvature lower bounds in distribution sense. In…

We present the Tetrahedral Compactness Theorem which states that sequences of Riemannian manifolds with a uniform upper bound on volume and diameter that satisfy a uniform tetrahedral property have a subsequence which converges in the…

Lower bounds estimates are proved for the first eigenvalue for the Dirichlet Laplacian on arbitrary triangles using various symmetrization techniques. These results can viewed as a generalization of P\'olya's isoperimetric bounds. It is…

We introduce the notion of \emph{bounded diameter arboricity}. Specifically, the \emph{diameter-$d$ arboricity} of a graph is the minimum number $k$ such that the edges of the graph can be partitioned into $k$ forests each of whose…

On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…

We prove lower bound for the first closed or Neumann nonzero eigenvalue of the Laplacian on a compact quaternion-K\"ahler manifold in terms of dimension, diameter, and scalar curvature lower bound. It is derived as large time implication of…

We prove sharp Dirichlet eigenvalue inequalities for planar triangles. We settle a conjecture of Laugesen and Siudeja by showing that the equilateral triangle uniquely minimizes a scale-invariant functional of the first Dirichlet…

This paper investigates the first Dirichlet eigenvalue for the $p$-Laplacian in Riemannian manifolds. Firstly, we establish a lower bound for this eigenvalue under the condition that the domain includes a specific function which fulfills…

In this paper, we study certain inequalities and a related result for weighted Sobolev spaces on H\"older-$\alpha$ domains, where the weights are powers of the distance to the boundary. We obtain results regarding the divergence equation's…

In this paper, we prove the optimal lower bound $\frac{\lambda_n}{\lambda_m}\geq(\frac{n}{m})^2$ of vibrating string $$-y''=\lambda\rho(x) y,$$ with Dirichlet boundary conditions for concave densities. Our aproach is based on the method of…

We investigate the equivalence of relative Faber-Krahn inequalities and the conjunction of Gaussian upper heat kernel bounds and volume doubling on large scales on graphs. For the normalizing measure, we obtain their equivalence up to…

For an integer $k$ at least $2$, and a graph $G$, let $f_k(G)$ be the minimum cardinality of a set $X$ of vertices of $G$ such that $G-X$ has either $k$ vertices of maximum degree or order less than $k$. Caro and Yuster (Discrete…

In the recent paper, \cite{tilli} Nicola and Tilli proved the Faber-Krahn inequality, which for $p=2$, states the following. If $f\in\mathcal{F}_\alpha^2$ is an entire function from the corresponding Fock space, then…

In this paper we prove a reverse Faber-Krahn inequality for the principal eigenvalue $\mu_1(\Omega)$ of the fully nonlinear eigenvalue problem \[ \label{eq} \left\{\begin{array}{r c l l} -\lambda_N(D^2 u) & = & \mu u & \text{in }\Omega, \\…

The eccentricity matrix $\varepsilon(G)$ of a graph $G$ is constructed from the distance matrix of $G$ by keeping only the largest distances for each row and each column. This matrix can be interpreted as the opposite of the adjacency…

In this paper, some special distance spectral properties of graphs are considered. Concretely, we recursively construct an infinite family of trees with distance eigenvalue $-1$, and determine all $\{C_3,C_4\}$-free connected graphs with…

Let $G$ be a graph. Its laplacian matrix $L(G)$ is positive and we consider eigenvectors of its first non-null eigenvalue that are called Fiedler vector. They have been intensively used in spectral partitioning problems due to their good…