Related papers: Sharp Inequalities for maximal operators on finite…

We obtain sharp two-sided inequalities between $L^p-$norms $(1<p<\infty)$ of functions $Hf$ and $H^*f$, where $H$ is the Hardy operator, $H^*$ is its dual, and $f$ is a nonnegative measurable function on $(0,\infty).$ In an equivalent form,…

The classical sharp Hardy-Littlewood-Sobolev inequality states that, for $1<p, t<\infty$ and $0<\lambda=n-\alpha <n$ with $ 1/p +1 /t+ \lambda /n=2$, there is a best constant $N(n,\lambda,p)>0$, such that $$ |\int_{\mathbb{R}^n}…

We precisely evaluate the operator norm of the uncentered Hardy-Littlewood maximal function on $L^p(\Bbb R^1)$. We also compute the operator norm of the uncentered Hardy-Littlewood maximal function over rectangles on $L^p(\Bbb R^n)$, and we…

Let $\mathscr{H}^2$ denote the Hardy space of Dirichlet series $f(s) = \sum_{n\geq1} a_n n^{-s}$ with square summable coefficients and suppose that $\varphi$ is a symbol generating a composition operator on $\mathscr{H}^2$ by…

For a real-valued function $f$ on a metric measure space $(X,d,\mu)$ the Hardy-Littlewood maximal-function of $f$ is given by the following `supremum-norm':…

The Hardy--Littlewood inequalities on $\ell _{p}$ spaces provide optimal exponents for some classes of inequalities for bilinear forms on $\ell _{p}$ spaces. In this paper we investigate in detail the exponents involved in Hardy--Littlewood…

Assume that $p\in(1,\infty]$ and $u=P_{h}[\phi]$, where $\phi\in L^{p}(\mathbb{S}^{n-1},\mathbb{R}^{n})$. Then for any $x\in \mathbb{B}^{n}$, we obtain the sharp inequalities $$ |u(x)|\leq…

We prove that the Hardy--Littlewood maximal operator $M$ is bounded on the variable Lebesgue space $L^{p(\cdot)}(X,d,\mu)$, with $1<p_-\le p_+<\infty$, over an unbounded space of homogeneous type $(X,d,\mu)$ with a Borel-semiregular measure…

For a graph $G$ define the parameters $\ell(G)$ and $L(G)$ as the minimum and maximum value of $\nu(G\backslash F)$, where $F$ is a maximum matching of $G$ and $\nu(G)$ is the matching number of $G$. In this paper, we show that there is a…

For $p\in (1,\infty)$ and $\alpha\in\mathbb{R}$, we consider measurable functions $g$ on $\mathbb{S}^{N-1}$ that satisfy the following weighted Hardy inequality: \begin{equation}\label{abs} \int_{\mathbb{R}^N}\frac{ g…

Let $\mathcal{B}$ be a nonempty homothecy invariant collection of convex sets of positive finite measure in $\mathbb{R}^2$. Let $M_\mathcal{B}$ be the geometric maximal operator defined by $$M_\mathcal{B}f(x) = \sup_{x \in R \in…

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…

The toughness of a graph $G$ is defined as the minimum value of $|S|/c(G-S)$ over all cutsets $S$ of $G$ if $G$ is noncomplete, and is defined to be $\infty$ if $G$ is complete. For a real number $t$, we say that $G$ is $t$-tough if its…

In the paper "The best m-term approximation and greedy algorithms" (V. N. Temlyakov), an error bound for a near best m-term approximation of a function g in L^p([0,1]^d) is provided, using a basis L^p-equivalent to the Haar system, where p…

Let $u_k(G,p)$ be the maximum over all $k$-vertex graphs $F$ of by how much the number of induced copies of $F$ in $G$ differs from its expectation in the binomial random graph with the same number of vertices as $G$ and with edge…

We prove an appropriate sharp quantitative reverse H\"older inequality for the $C_p$ class of weights from which we obtain as a limiting case the sharp reverse H\"older inequality for the $A_\infty$ class of weights. We use this result to…

Given a space of homogeneous type $(X,\mu,d)$, we prove strong-type weighted norm inequalities for the Hardy-Littlewood maximal operator over the variable exponent Lebesgue spaces $L^\pp$. We prove that the variable Muckenhoupt condition…

We improve and generalize some operator inequalities for positive linear maps. It is shown, among other inequalities, that if $0<m\le B\le m'<M'\le A\le M$ or $0<m\le A\le m'<M'\le B\le M$, then for each $2\le p<\infty $ and $\nu \in \left[…

For $N \geq 3$ and $p \in (1,N)$, we look for $g \in L^1_{loc}(\mathbb{R}^N)$ that satisfies the following weighted logarithmic Sobolev inequality: \begin{equation*} \int_{\mathbb{R}^N} g |u|^p \log |u|^p \ dx \leq \gamma \log \left(…

In the zero-error Slepian-Wolf source coding problem, the optimal rate is given by the complementary graph entropy $\overline{H}$ of the characteristic graph. It has no single-letter formula, except for perfect graphs, for the pentagon…