Related papers: Properties for CD Inequalities with Unbounded Lapl…
On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…
The Hardy-Rellich inequality given here generalizes a Hardy inequality of Davies (1984), from the case of the Dirichlet Laplacian of a region $\Omega\subseteq\real^N$ to that of the higher order polyharmonic operators with Dirichlet…
This is a slightly enlarged and corrected version of a contribution to the Oberwolfach Reports 3(1):511-552, 2006. We summarise some results on spectral properties of Laplacians on percolation graphs and more general Anderson-percolation…
In this paper we present new L-borderenergetic graphs, this is, graphs which are L-noncospectral with Kn but have the same Laplacian energy. We also present some graphs which are noncospectral to respective normalized Laplacian energy and…
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…
In this paper we study integral estimates of derivatives of conformal mappings $\varphi:\mathbb D\to\Omega$ of the unit disc $\mathbb D\subset\mathbb C$ onto bounded domains $\Omega$ that satisfy the Ahlfors condition. These integral…
The goal of this paper is to derive the so-called five gradients inequality for optimal transport theory for general cost functions on two class of differentiable manifolds: locally compact Lie groups and compact Riemannian manifolds.
We obtain inequalities for the Riesz means for the discrete spectrum of a class of self-adjoint compact integral operators. Such bounds imply some inequalities for the counting function of the Dirichlet boundary problem for the Laplace…
The optimal constants in a class of exponential type inequalities for the Ornstein-Uhlenbeck operator in the Gauss space are detected. The existence of extremal functions in the relevant inequalities is also established. Our results…
A $k$-uniform hypergraph $G=(V,E)$ is called odd-bipartite ([5]), if $k$ is even and there exists some proper subset $V_1$ of $V$ such that each edge of $G$ contains odd number of vertices in $V_1$. Odd-bipartite hypergraphs are…
We prove that the Dirichlet eigenvalues of the Laplace-Beltrami operator on a compact Riemannian manifold with cylindrical boundary can be approximated by the spectrum of truncated graph Laplacians constructed from…
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.…
In this paper,we will give an easy example to satisfy that we can not conclude CDE' Inequality just from the CD Inequality.
In this paper, we compute universal inequalities of eigenvalues of a large class of second-order elliptic differential operators in divergence form, that includes, e.g., the Laplace and Cheng-Yau operators, on a bounded domain in a complete…
We present a thorough study of the theoretical properties and devise efficient algorithms for the \emph{persistent Laplacian}, an extension of the standard combinatorial Laplacian to the setting of pairs (or, in more generality, sequences)…
Graph Laplacians as well as related spectral inequalities and (co-)homology provide a foray into discrete analogues of Riemannian manifolds, providing a rich interplay between combinatorics, geometry and theoretical physics. We apply some…
We obtain restrictions on the persistence barcodes of Laplace-Beltrami eigenfunctions and their linear combinations on compact surfaces with Riemannian metrics. Some applications to uniform approximation by linear combinations of Laplace…
This paper reviews many of the known inequalities for the eigenvalues of the Laplacian and bi-Laplacian on bounded domains in Euclidean space. In particular, we focus on isoperimetric inequalities for the low eigenvalues of the Dirichlet…
Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient…
In this paper we study the gradient estimate for positive solutions of Schrodinger equations on locally finite graph. Then we derive Harnack's inequality for positive solutions of the Schrodinger equations. We also set up some results about…