Related papers: Discrete functional inequalities on lattice graphs
In this paper, we prove a sharp, weighted Hardy-type inequality for the Dirac operator. A key feature of our result is that the inequality is not only sharp but also attained, and we construct explicit minimizers that satisfy the equality…
Applying methods of Real Analysis and Functional Analysis, we build two weight functions with parameters and provide two kinds of parameterized Yang-Hilbert-type integral inequalities with the best constant factors. Equivalent forms, the…
A smooth rigidity inequalitiy provides an explicit lower bound for the $(d+1)$-st derivatives of a smooth function $f$, which holds, if $f$ exhibits certain patterns, forbidden for polynomials of degree $d$. The main goal of the present…
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework contracting edges of a graph (merging vertices…
In this paper we establish the reversed sharp Hardy-Littlewood-Sobolev (HLS for short) inequality on the upper half space and obtain a new HLS type integral inequality on the upper half space (extending an inequality found by Hang, Wang and…
We propose a method for designing accurate interpolation formulas on the real axis for the purpose of function approximation in weighted Hardy spaces. In particular, we consider the Hardy space of functions that are analytic in a strip…
This is a chapter from PhD Thesis by Stefano Biagi (advisor: prof. A. Bonfiglioli). We overview existing results showing that it is possible to generalize the classical Hardy's Inequality to more general linear partial differential…
Schultz \cite{S98} proved dispersive estimates for the wave equation on lattice graphs $\mathbb{Z}^d$ for $d=2,3,$ which was extended to $d=4$ in \cite{BCH23}. By Newton polyhedra and the algorithm introduced by Karpushkin \cite{K83}, we…
In this paper, we give the characterization of the embeddings between weighted Ces\`aro function spaces. The proof is based on the duality technique, which reduces this problem to the characterizations of some direct and reverse Hardy-type…
In this paper, we proved the sharp gradient stability for a class of Hardy-Sobolev-Maz'ya inequalities with partial (stronger) singular weight and non-radial extremal functions. Our result seems to be the first stability result for…
We study some Hardy-type inequalities involving a general norm in $R^n$ and an anisotropic distance function to the boundary. The case of the optimality of the constants is also addressed.
We present sharp interpolation theorems, including all limiting cases, for a class of quasilinear operators of joint weak type acting between Lorentz-Karamata spaces over $\sigma$-finite measure. This class contains many of the important…
In this note besides two abstract versions of the Vitali Covering Lemma an abstract Hardy-Littlewood Maximal Inequality, generalizing weak type (1,1) maximal function inequality, associated to any outer measure and a family of subsets on a…
We establish a characterization of the Hardy spaces on the homogeneous groups in terms of the Littlewood-Paley functions. The proof is based on vector-valued inequalities shown by applying the Peetre maximal function.
In this paper, various kinds of invariants of directed graphs are summarized. In the first topic, the invariant w(G) for a directed graph G is introduced, which is primarily defined by S. Chen and X.M. Chen to solve a problem of weak…
We introduce the Schur class of functions, discrete analytic on the integer lattice in the complex plane. As a special case, we derive the explicit form of discrete analytic Blaschke factors and solve the related basic interpolation…
We establish Hardy inequalities involving a weight function on complete, not necessarily reversible Finsler manifolds. We prove that the superharmonicity of the weight function provides a sufficient condition to obtain Hardy inequalities.…
This paper addresses the behavior of the Lov\'asz number for dense random circulant graphs. The Lov\'asz number is a well-known semidefinite programming upper bound on the independence number. Circulant graphs, an example of a Cayley graph,…
In this paper, we introduce a novel first-order derivative for functions on a lattice graph, which extends the discrete Laplacian and generalizes the theory of discrete PDEs on lattices. First, we establish the well-posedness of generalized…
We prove a general self-improvement property for a family of weighted pointwise inequalities on open sets, including pointwise Hardy inequalities with distance weights. For this purpose we introduce and study the classes of $p$-Poincar\'e…