Related papers: Sharp Inequalities for maximal operators on finite…

We prove \emph{optimal} improvements of the Hardy inequality on the hyperbolic space. Here, optimal means that the resulting operator is critical in the sense of [J.Funct.Anal. 266 (2014), pp. 4422-89], namely the associated inequality…

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…

For $m \geq 2$, let $(\mathbb{Z}_{m+1}^N, |\cdot|)$ denote the group equipped with the so-called $l^0$ metric, \[ |y| = \left| \big( y(1), \dots, y(N) \big) \right| := | \{1 \leq i \leq N : y(i) \neq 0 \} |,\] and define the…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$. For fixed $n$ and $m$, the uniformly most reliable problem asks which graph with $n$ vertices…

The size of a largest independent set of vertices in a given graph $G$ is denoted by $\alpha(G)$ and is called its independence number (or stability number). Given a graph $G$ and an integer $K,$ it is NP-complete to decide whether…

We give a quantitative characterization of the pairs of weights $(w,v)$ for which the dyadic version of the one-sided Hardy-Littlewood maximal operator satisfies a restricted weak $(p,p)$ type inequality, for $1\leq p<\infty$. More…

Given a family G of rectangles, to which one associates a tree [G], one defines a natural number $\lambda$ [G] called its analytic split and satisfying, for all 1 < p < $\infty$ log($\lambda$ [G]) p MG p p where MG is the Hardy-Littlewood…

For a connected graph $G$, let $\mu(G)$ denote the distance spectral radius of $G$. A matching in a graph $G$ is a set of disjoint edges of $G$. The maximum size of a matching in $G$ is called the matching number of $G$, denoted by…

We show that a function $ f $ of bounded variation satisfies $$ \Var Mf \leq C \Var f $$ where $ Mf $ is the centered Hardy-Littlewood maximal function of $ f $. Consequently, the operator $ f \mapsto (Mf)' $ is bounded from $ W^{1,1}(R) $…

The Hardy--Littlewood inequality for $m$-linear forms on $\ell _{p}$ spaces and $m<p\leq 2m$ asserts that \begin{equation*} \left( \sum_{j_{1},...,j_{m}=1}^{\infty }\left\vert T\left( e_{j_{1}},\ldots ,e_{j_{m}}\right) \right\vert…

Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$.…

Let $p$ be a prime number and let $G$ be a graph on $n$ vertices and $m$ edges. The zero-sum Ramsey number of $G$ over $\mathbb{Z}_p$, denoted by $R(G, \mathbb{Z}_p)$, is the minimum $\ell\in \mathbb{N}$ such that for any edge-coloring…

For $r\geq 2$ and $p\geq 1$, the $p$-spectral radius of an $r$-uniform hypergraph $H=(V,E)$ on $n$ vertices is defined to be $$\rho_p(H)=\max_{{\bf x}\in \mathbb{R}^n: \|{\bf x}\|_p=1}r \cdot \!\!\!\! \sum_{\{i_1,i_2,\ldots, i_r\}\in E(H)}…

In this paper we consider the vector-valued Schr\"{o}dinger operator $-\Delta + V$, where the potential term $V$ is a matrix-valued function whose entries belong to $L^1_{\rm loc}(\mathbb{R}^d)$ and, for every $x\in\mathbb{R}^d$, $V(x)$ is…

We obtain sharp bounds for the modulus of continuity of the uncentered maximal function in terms of the modulus of continuity of the given function, via integral formulas. Some of the results deduced from these formulas are the following:…

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…

The Hardy-Littlewood inequalities for $m$-linear forms on $\ell_{p}$ spaces are stated for $p>m$. In this paper, among other results, we investigate similar results for $1\leq p\leq m.$ Let $\mathbb{K}$ be $% \mathbb{R}$ or $\mathbb{C}$ and…

A now classical result in the theory of variable Lebesgue spaces due to Lerner [A. K. Lerner, On modular inequalities in variable $L^p$ spaces, Archiv der Math. 85 (2005), no. 6, 538-543] is that a modular inequality for the…

The $p$-spectral radius of a graph $G\ $of order $n$ is defined for any real number $p\geq1$ as \[ \lambda^{\left( p\right) }\left( G\right) =\max\left\{ 2\sum_{\{i,j\}\in E\left( G\right) \ }x_{i}x_{j}:x_{1},\ldots,x_{n}\in\mathbb{R}\text{…