Related papers: Sharp Inequalities for maximal operators on finite…

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,$…

We study mapping properties of the centered Hardy--Littlewood maximal operator $\mathcal{M}$ acting on Lorentz spaces. Given $p \in (1,\infty)$ and a metric measure space $\mathfrak{X}$ we let $\Omega^p_{\rm HL}(\mathfrak{X}) \subset…

We study $l^p$ operator norms of factorable matrices and related results. We give applications to $l^p$ operator norms of weighted mean matrices and Copson's inequalities. We also apply the method in this paper to study the best constant in…

For a graph $G$ and $p\in[0,1]$, we denote by $G_p$ the random sparsification of $G$ obtained by keeping each edge of $G$ independently, with probability $p$. We show that there exists a $C>0$ such that if $p\geq C(\log n)^{1/3}n^{-2/3}$…

We introduce and study the median maximal function \mathcal{M} f, defined in the same manner as the classical Hardy-Littlewood maximal function, only replacing integral averages of f by medians throughout the definition. This change has a…

A graph $G$ is $[a,b]$-covered if for each edge $e$ of $G$ there is an $[a,b]$-factor containing it. For $a=b=1$, an $[a,b]$-covered graph is a matching covered graph. The structural theory of matching covered graphs constitutes a…

In the paper we study sharp maximal inequalities for martingales and non-negative submartingales: if $f$, $g$ are martingales satisfying \[|\mathrm{d}g_n|\leq|\mathrm{d}f_n|,\qquad n=0,1,2,...,\] almost surely, then…

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…

For a real constant $\alpha$, let $\pi_3^\alpha(G)$ be the minimum of twice the number of $K_2$'s plus $\alpha$ times the number of $K_3$'s over all edge decompositions of $G$ into copies of $K_2$ and $K_3$, where $K_r$ denotes the complete…

A span of a given graph $G$ is the maximum distance that two players can keep at all times while visiting all vertices (edges) of $G$ and moving according to certain rules, that produce different variants of span. We prove that the vertex…

In 1991, Bollob\'{a}s and Frieze showed that the threshold for $G_{n,p}$ to contain a spanning maximal planar subgraph is very close to $p = n^{-1/3}$. In this paper, we compute similar threshold ranges for $G_{n,p}$ to contain a maximal…

A graph $G = (V,E)$ is globally rigid in $\mathbb{R}^d$ if for any generic placement $p : V \rightarrow \mathbb{R}^d$ of the vertices, the edge lengths $||p(u) - p(v)||, uv \in E$ uniquely determine $p$, up to congruence. In this paper we…

Given a graph $G$ and $p\in [0,1]$, the random subgraph $G_p$ is obtained by retaining each edge of $G$ independently with probability $p$. We show that for every $\epsilon>0$, there exists a constant $C>0$ such that the following holds.…

Let $G$ be a graph with an even number of vertices. The matching preclusion number of $G$, denoted by $mp(G)$, is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. We introduced a $0$-$1$…

This paper focuses on the operator norm of the truncated Hardy-Littlewood maximal operator $M^b_a$ and the strong truncated Hardy-Littlewood maximal operator $\tilde{M}^{\boldsymbol{b}}_{\boldsymbol{a}}$, respectively. We first present the…

Sharp weighted estimates are obtained for vector-valued extensions of the Hardy-Littlewood maximal operator, Calder\'on-Zygmund operators and Coifman-Rochberg-Weiss commutator. Those estimates will rely upon suitable pointwise estimates in…

We investigate the Hilbert transform and the maximal operator along a class of variable non-flat polynomial curves $(P(t),u(x)t)$ with measurable $u(x)$, and prove uniform $L^p$ estimates for $1<p<\infty$. In particular, via the change of…

In this paper we show how to solve the \emph{Maximum Weight Stable Set Problem} in a claw-free graph $G(V, E)$ with $\alpha(G) \le 3$ in time ${\cal O}(|E|\log|V|)$. More precisely, in time ${\cal O}(|E|)$ we check whether $\alpha(G) \le 3$…

In this paper, we investigate the approximability of two node deletion problems. Given a vertex weighted graph $G=(V,E)$ and a specified, or "distinguished" vertex $p \in V$, MDD(min) is the problem of finding a minimum weight vertex set $S…

We present some operator inequalities for positive linear maps that generalize and improve the derived results in some recent years. For instant, if $A$ and $B$ are positive operators and $m,m^{'},M,M^{'}$ are positive real numbers…