相关论文: Harris' criterion and Hardy inequalites on graphs
We consider discrete metric spaces and we look for non-constant contractions. We introduce the notion of contractive map and we characterize the spaces with non-constant contractive maps. We provide some examples to discussion the possible…
Hardy space theory has been studied on manifolds or metric measure spaces equipped with either Gaussian or sub-Gaussian heat kernel behaviour. However, there are natural examples where one finds a mix of both behaviour (locally Gaussian and…
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…
We present new estimate for Hardy-type inequality in variable exponent Lebesgue spaces. More precisely, by imposing regularity assumptions on the exponent, we prove that the estimations can be reduced to the fixed exponents.
In this paper, we consider the first order Hardy inequalities using simple equalities. This basic setting not only permits to derive quickly many well-known Hardy inequalities with optimal constants, but also supplies improved or new…
We give sharp limiting case Hardy inequalities on the sphere $\mathbb{S}^{2}$ and show that their optimal constants are unattainable by any $f\in H^{1}\left(\mathbb{S}^{2}\right)\setminus\{0\}$. The singularity of the problem is related to…
This note has a twofold purpose. To improve the best known lower estimates of the Hardy-Littlewood inequality for $m$-linear forms in $\ell_{p}$ spaces and to provide a closed formula encompassing the cases $p>2m$ and $% p=2m.$ Our approach…
If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$ to say that every orientation of the edges of $G$ contains $\vec H$ as a subdigraph. We consider the case in which $G=G(n,p)$, the binomial random graph. We…
We study the behavior of the smallest possible constants $d(a,b)$ and $d_n$ in Hardy's inequalities $$ \int_a^b\left(\frac{1}{x}\int_a^xf(t)dt\right)^2\,dx\leq d(a,b)\,\int_a^b [f(x)]^2 dx $$ and $$…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
In this short note we obtain new lower bounds for the constants of the real Hardy--Littlewood inequality for $m$-linear forms on $\ell_{p}^{2}$ spaces when $p=2m$ and for certain values of $m$. The real and complex cases for the general…
In the present paper we shall improve one dimensional weighted Hardy inequalities with one-sided boundary condition by adding sharp remainders. As an application, we shall establish n dimensional weighted Hardy inequalities in a bounded…
This paper studies the following question of Bollob\'as and Scott: Let $G$ be a graph with $n$ vertices and $p\binom{n}{2}$ edges. What is the smallest $c(p, n)$ such that there is an ordering $v_1, \ldots, v_n$ of the vertices in $G$ with…
We define by interpolation a scale analogous to the Hardy $H^p$ scale for complete Pick spaces, and establish some of the basic properties of the resulting spaces, which we call $\mathcal{H}^p$. In particular, we obtain an…
The Cheeger inequalities give an upper and lower bound on the spectral gap of discrete Laplacians defined on a graph in terms of the geometric characteristics of the graph. We generalise this approach and we employ it to determine if a…
In this paper, we give an atomic decomposition characterization of flag Hardy spaces $H^p_F({\rr}^n\times {\rr}^m)$ for $0<p\le 1$, which were introduced in \cite{hl1}. A remarkable feature of atoms of such flag Hardy spaces is that these…
We prove the self-improvement of a pointwise $p$-Hardy inequality. The proof relies on maximal function techniques and a characterization of the inequality by curves.
We show that, when $sp>N$, the sharp Hardy constant $\mathfrak{h}_{s,p}$ of the punctured space $\mathbb R^N\setminus\{0\}$ in the Sobolev-Slobodecki\u{\i} space provides an optimal lower bound for the Hardy constant…