Related papers: From Hardy to Rellich inequalities on graphs
We calculate effective impedances of infinite $LC$- and $CL$- ladder networks as limits of effective impedances of finite network approximations, using a new method, which involves precise mathematical concepts. These concepts are related…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
We prove sufficient conditions on a parameter sequence to determine optimal weights in inequalities for an integer power $\ell$ of the discrete Laplacian on the half-line. By a concrete choice of the parameter sequence, we obtain explicit…
We prove that both multiple Rademacher system and Rademacher chaos possess the property of random unconditional convergence in the space $L_\infty$. This fact combined with some intimate connections between $L_\infty$-norms of linear…
We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…
We prove a sharp $L^p$ weighted Hardy inequality involving boundary distance $\delta$ for any domain $\Omega\subsetneq \mathbb R^n$. The inequality may be improved substantially under the additional assumption that $-\log \delta$ is…
We prove multipolar Hardy inequalities on complete Riemannian manifolds, providing various curved counterparts of some Euclidean multipolar inequalities due to Cazacu and Zuazua [Improved multipolar Hardy inequalities, 2013]. We notice that…
We investigate the torsion function or landscape function and its integral, the torsional rigidity, of Laplacians on metric graphs subject to $\delta$-vertex conditions. A variational characterization of torsional rigidity and Hadamard-type…
In this paper, we study the existence of extremal functions of the discrete Sobolev inequality and Hardy-Littlewood-Sobolev inequality on lattice graphs. We introduce the discrete Concentration-Compactness principle, and prove the existence…
We investigate the fractional Orlicz boundary Hardy-type inequality for bounded Lipschitz domains. Further, we establish fractional Orlicz boundary Hardy-type inequalities with logarithmic corrections for specific critical cases across…
Let $\Delta_0$ be the Laplace-Beltrami operator on the unit sphere $\mathbb{S}^{d-1}$ of $\mathbb{R}^d$. We show that the Hardy-Rellich inequality of the form $$ \int_{\mathbb{S}^{d-1}} \left | f (x)\right|^2 d\sigma(x) \leq c_d \min_{e\in…
We prove Rellich and improved Rellich inequalities that involve the distance function from a hypersurface of codimension $k$, under a certain geometric assumption. In case the distance is taken from the boundary, that assumption is the…
A refinement of the Hardy inequality has been presented by use of superquadratic function.
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…
In this paper we obtain weighted higher order Rellich, weighted Gagliardo-Nirenberg, Trudinger, Caffarelli-Kohn-Nirenberg inequalities and the uncertainty principle for Dunkl operators. Moreover, we introduce an extension of the classical…
We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on…
Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the well-known Courant's nodal domain theorem on continuous…
We study different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy-Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having finite…
We prove a quantitative uncertainty principle at low energies for the Laplacian on fairly general weighted graphs with a uniform explicit control of the constants in terms of geometric quantities. A major step consists in establishing lower…
In this note we formulate recent stability results for Hardy inequalities in the language of Folland and Stein's homogeneous groups. Consequently, we obtain remainder estimates for Rellich type inequalities on homogeneous groups. Main…