Related papers: Sharp inequalities for maximal operators on finite…

Given a multigraph $G$, the all-terminal reliability $R(G,p)$ is the probability that $G$ remains connected under percolation with parameter $p$. Fixing the number of vertices $n$ and edges $m$, we investigate which graphs maximize $R(G,p)$…

The goal of this note is to provide an alternative proof of Theorem 1.1 (i) in [4], that is, if $n\geq 2$ and $M^{\alpha}$ is bounded on $L^{p}(\mathbb{R}^{n})$ for some $\alpha\in \mathbb{C}$ and $p\geq 2$, then we have \begin{align*}…

Markoff mod-$p$ graphs are conjectured to be connected for all primes $p$. In this paper, we use results of Chen and Bourgain, Gamburd, and Sarnak to confirm the conjecture for all $p > 3.448\cdot10^{392}$. We also provide a method that…

In this paper we present a proof of sharp boundedness of the discrete 1-dimensional Hardy-Littlewood nontangential maximal operator, when the parameter is in the range $[\frac{1}{3},+\infty)$. This generalizes a theorem by Bober, Carneiro,…

In this paper we study the $L^p$ boundedness of the centred and the uncentred Hardy--Littlewood maximal operators on certain Riemannian manifolds with bounded geometry. Our results complement those of various authors. We show that, under…

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 purpose of this paper is to prove pointwise inequalities and to establish the boundedness on weighted $L^{p}$ spaces for pseudo-differential operators $T_{a}$ defined by the symbol $a\in S^{m}_{\varrho,\delta}$ with $0\leq\varrho\leq1,$…

Let $T$ be a finite tree graph, $T^N$ be the Cartesian power graph of $T$, and $d^N$ be the graph distance metric on $T^N$. Also let \[ \mathbb S_r^N(x) := \{v \in T^N: d^N(x,v) = r\} \] be the sphere of radius $r$ centered at $x$ and $M$…

Operators such as Carleson operator are known to be bounded on $L^p$ for all $1<p<\infty$, but not from $L^1$ to weak-$L^1$ and from $H^p$ to $L^p$ for each $0<p\leq 1$, the object of this article is to give a estimate for all $0<p<\infty$.…

The main aim of this paper is to prove that the maximal operator $\sigma_{p}^{\kappa ,\ast }f:=\sup_{n\in \mathbf{P}}\left\vert \sigma_{n}^{\kappa }f\right\vert /\left( n+1\right) ^{1/p-2}$ is bounded from the Hardy space $% H_{p}$ to the…

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 show that for any constant $\Delta \ge 2$, there exists a graph $G$ with $O(n^{\Delta / 2})$ vertices which contains every $n$-vertex graph with maximum degree $\Delta$ as an induced subgraph. For odd $\Delta$ this significantly improves…

One of the purposes of this paper is to prove that if G is a noncompact connected semisimple Lie group of real rank one with finite center, then L^{2,1}(G)\ast L^{2,1}({G})\subseteq L^{2,\infty}({G}). Let {K} be a maximal compact subgroup…

The $L^2 \to L^p$ adjoint Fourier restriction inequality on the $d$-dimensional hyperboloid $\mathbb{H}^d \subset \mathbb{R}^{d+1}$ holds provided $6 \leq p < \infty$, if $d=1$, and $2(d+2)/d \leq p\leq 2(d+1)/(d-1)$, if $d\geq2$.…

Operator learning has been highly successful for continuous mappings between infinite-dimensional spaces, such as PDE solution operators. However, many operators of interest-including differential operators-are discontinuous or set-valued,…

For any $\epsilon > 0$, we show that if $G$ is a regular graph on $n \gg_\epsilon 1$ vertices that is $\epsilon$-far (differs by at least $\epsilon n^2$ edges) from any Tur\'{a}n graph, then its second eigenvalue $\lambda_2$ satisfies…

Let $\mathcal M$ be the uncentered Hardy-Littlewood maximal operator or the dyadic maximal operator and $d\geq1$. We prove that for a set $E\subset\mathbb R^d$ of finite perimeter the bound $\operatorname{var}\mathcal M1_E\leq…

Let T : Lp --> Lp be a contraction, with p strictly between 1 and infinity, and assume that T is analytic, that is, there exists a constant K such that n\norm{T^n-T^{n-1}} < K for any positive integer n. Under the assumption that T is…

Let $G$ be a simple graph of order $n$ with degree sequence $(d_1,d_2,\cdots,d_n)$. For an integer $p>1$, let $e_p(G)=\sum_{i=1}^n d^{p}_i$ and let $ex_p(n,H)$ be the maximum value of $e_p(G)$ among all graphs with $n$ vertices that do not…

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…