Related papers: Sharp inequalities for maximal operators on finite…

In this note we establish the boundedness properties of local maximal operators $M_G$ on the fractional Sobolev spaces $W^{s,p}(G)$ whenever $G$ is an open set in $\mathbb{R}^n$, $0<s<1$ and $1<p<\infty$. As an application, we characterize…

The representation for the sharp constant ${\rm K}_{n, p}$ in an estimate of the modulus of the $n$-th derivative of an analytic function in the upper half-plane ${\mathbb C}_+$ is considered. It is assumed that the boundary value of the…

We show that there is a constant c>0 so that for any fixed r which is at least 3 a.a.s. an r-regular graph on n vertices contains a complete graph on c n^{1/2} vertices as a minor. This confirms a conjecture of Markstrom. Since any minor of…

We present an algorithm that on input of an $n$-vertex $m$-edge weighted graph $G$ and a value $k$, produces an {\em incremental sparsifier} $\hat{G}$ with $n-1 + m/k$ edges, such that the condition number of $G$ with $\hat{G}$ is bounded…

For a fixed graph G, a maximal independent set is an independent set that is not a proper subset of any other independent set. P. Erd\"os, and independently, J. W. Moon and L. Moser, and R. E. Miller and D. E. Muller, determined the maximum…

Let $G$ be a graph with $m$ edges and let $\mathrm{mc}(G)$ denote the size of a largest cut of $G$. The difference $\mathrm{mc}(G)-m/2$ is called the surplus $\mathrm{sp}(G)$ of $G$. A fundamental problem in MaxCut is to determine…

Given a fixed graph $H$, a real number $p\in(0,1)$, and an infinite Erd\H{o}s-R\'enyi graph $G\sim G(\infty,p)$, how many adjacency queries do we have to make to find a copy of $H$ inside $G$ with probability $1/2$? Determining this number…

We prove sharp uniform $L^p$-bounds for low-lying eigenfunctions of non-self-adjoint semiclassical pseudodifferential operators $P$ on $\mathbb{R}^{n}$ whose principal symbols are doubly-characteristic at the origin of $\mathbb{R}^{2n}$.…

We investigate the weighted bounds for multilinear maximal functions and Calder\'on-Zygmund operators from $L^{p_1}(w_1)\times...\times L^{p_m}(w_m)$ to $L^{p}(v_{\vec{w}})$, where $1<p_1,...,p_m<\infty$ with $1/{p_1}+...+1/{p_m}=1/p$ and…

Let $mH$ be the graph formed by $m$ vertex-disjoint copies of a graph $H$. Let $G \to (H)_r$ denote that, in any $r$-colouring of the edges of $G$, there exists a monochromatic copy of $H$. In 1975, Burr, Erd\H{o}s, and Spencer showed that…

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

We prove that for a finite type curve in $\mathbb R^3$ the maximal operator generated by dilations is bounded on $L^p$ for sufficiently large $p$. We also show the endpoint $L^p \to L^{p}_{1/p}$ regularity result for the averaging operators…

For graphs $F$ and $H$, let $f_{F,H}(n)$ be the minimum possible size of a maximum $F$-free induced subgraph in an $n$-vertex $H$-free graph. This notion generalizes the Ramsey function and the Erd\H{o}s--Rogers function. Establishing a…

To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let $\mathcal{G}(g,c,n)$ be the set of graphs $G$ with girth $g(G)=g$, circumference…

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…

Let $M_G$ denotes the centered Hardy-Littlewood maximal function associated to the Carnot-Carath\'eodory distance or to the pseudo-distance associated to the fundamental solution of the Grushin operator on $\R_x^n \times \R_u$, $\Delta_G =…

For graphs $G$ and $H$, let $G {\displaystyle\smash{\begin{subarray}{c} \hbox{$\tiny\rm rb$} \\ \longrightarrow \\ \hbox{$\tiny\rm p$} \end{subarray}}}H$ denote the property that for every proper edge-colouring of $G$ there is a rainbow $H$…

For graphs $F$ and $G$, let $F\to G$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$. Denote by ${\cal G}(N,p)$ the random graph space of order $N$ and edge probability $p$. Using the regularity method, one can…

As introduced by Bollob\'as, a graph $G$ is weakly $H$-saturated if the complete graph $K_n$ is obtained by iteratively completing copies of $H$ minus an edge. For all graphs $H$, we obtain an asymptotic lower bound for the critical…

Given an infinite family ${\mathcal G}$ of graphs and a monotone property ${\mathcal P}$, an (upper) threshold for ${\mathcal G}$ and ${\mathcal P}$ is a "fastest growing" function $p: \mathbb{N} \to [0,1]$ such that $\lim_{n \to \infty}…