Related papers: Sharp inequalities for maximal operators on finite…

We present a new approach to graph limit theory which unifies and generalizes the two most well developed directions, namely dense graph limits (even the more general $L^p$ limits) and Benjamini--Schramm limits (even in the stronger…

Using some resolution of singularities and oscillatory integral methods in conjunction with appropriate damping and interpolation techniques, L^p boundedness theorems for p > 2 are obtained for maximal operators over a wide range of…

We prove $L^p$ boundedness results, $p > 2$, for local maximal averaging operators over a smooth 2D hypersurface $S$ with either a $C^1$ density function or a density function with a singularity that grows as $|(x,y)|^{-\beta}$ for $\beta <…

The main aim of this paper is to prove that when $0<p<1/2$ the maximal operator $\overset{\sim }{\sigma }_{p}^{\ast }f:=\underset{n\in \mathbb{N}}{% \sup }\frac{\left\vert \sigma_{n}f\right\vert }{\left( n+1\right) ^{1/p-2}}$ is bounded…

We present new values and bounds on the (normalised) closeness centrality $\bar{\mathsf{C}}_C$ of connected graphs and on its product $\bar{l}\bar{\mathsf{C}}_C$ with the mean distance $\bar{l}$ of these graphs. Our main result presents the…

The operator $T$, defined by convolution with the affine arc length measure on the moment curve parametrized by $h(t)=(t,t^{2},...,t^{d})$ is a bounded operator from $L^{p}$ to $L^{q}$ if $(\frac{1}{p}, \frac{1}{q})$ lies on a line segment.…

We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \in…

We prove that the family of largest cuts in the binomial random graph exhibits the following stability property: If $1/n \ll p = 1-\Omega(1)$, then, with high probability, there is a set of $n - o(n)$ vertices that is partitioned in the…

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…

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…

In this paper we address the following question: given $ p\in (1,\infty)$, $n \geq 1$, does there exists a constant $A(p,n)>1$ such that $\| M f\|_{L^{p}}\geq A(n,p) \| f\|_{L^{p}}$ for any nonnegative $f \in L^{p}(\mathbb{R}^{n})$, where…

The Sparsest Cut is a fundamental optimization problem that has been extensively studied. For planar inputs the problem is in $P$ and can be solved in $\tilde{O}(n^3)$ time if all vertex weights are $1$. Despite a significant amount of…

Suppose that $1<p\leq\infty$ and $\varphi\in L^{p}(\mathbb{B}^{n},\mathbb{R}^{n}).$ In this note, we use H\"{o}lder inequality and some basic properties of hypergeometric functions to establish the sharp constant $C_{p}$ and function…

We study the boundedness problem for maximal operators $\mathcal{M}$ associated to averages along families of hypersurfaces $S$ of finite type in $\mathbb{R}^n.$ In this paper, we prove that if $S$ is a finite type hypersurface which is of…

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…

We introduce the centred and the uncentred triangular maximal operators $\mathcal T$ and $\mathcal U$, respectively, on any locally finite tree in which each vertex has at least three neighbours. We prove that both $\mathcal T$ and…

We give a direct proof of the operator valued Hardy-Littlewood maximal inequality for $2<p<\infty$.

Define f(n,p) to be the maximum number of edges in a graph on n vertices with p perfect matchings. Dudek and Schmitt proved there exist constants n_p and c_p so that for even n >= n_p, f(n,p) = (n^2)/4+c_p. A graph is p-extremal if it has p…

Extending the methods developed in the author's previous paper and using adapted coordinate systems in two variables, an L^p boundedness theorem is proven for maximal operators over hypersurfaces in R^3 when p > 2. When the best possible p…

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…