Related papers: Sharp inequalities for maximal operators on finite…

We investigate the sharp endpoint extension inequality for the moment curve in finite fields. We determine the optimal constant and characterize the maximizers in two complementary regimes: (i) low dimensions $d\leq 20$; (ii) large field…

For a function $f\in L^p(\Bbb R^d)$, $d\ge 2$, let $A_t f(x)$ be the mean of $f$ over the sphere of radius $t$ centered at $x$. Given a set $E\subset (0,\infty)$ of dilations we prove endpoint bounds for the maximal operator $M_E$ defined…

In this note we confirm a conjecture raised by Benjamini et al. \cite{BST} on the acquaintance time of graphs, proving that for all graphs $G$ with $n$ vertices it holds that $\AC(G) = O(n^{3/2})$, which is tight up to a multiplicative…

Let $M$ denote the centered Hardy--Littlewood operator on $\mathbb{R}$. We prove that \[ {\rm Var} (Mf)\le {\rm Var} (f) - \frac12\big| |f(\infty)|-|f(-\infty)|\big| \] for piecewise constant functions $f$ with nonzero and zero values…

Given a positive integer $k$ and graph $G$, the $\mathbb{Z}_k$-Ramsey number $R(G,\mathbb{Z}_k)$ is the least $N$ (if it exists) such that every coloring $f:E(K_N)\rightarrow \mathbb{Z}_k$ contains a copy $G'$ of $G$ such that $\sum_{e\in…

We give a 2-approximation algorithm for Non-Uniform Sparsest Cut that runs in time $n^{O(k)}$, where $k$ is the treewidth of the graph. This improves on the previous $2^{2^k}$-approximation in time $\poly(n) 2^{O(k)}$ due to Chlamt\'a\v{c}…

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…

The "extremal function" $c(H)$ of a graph $H$ is the supremum of densities of graphs not containing $H$ as a minor, where the "density" of a graph $G$ is the ratio of the number of edges to the number of vertices. Myers and Thomason (2005),…

The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…

Let $G$ be a simple graph with $n$ vertices and $\pm 1$-weights on edges. Suppose that for every edge $e$ the sum of edges adjacent to $e$ (including $e$ itself) is positive. Then the sum of weights over edges of $G$ is at least…

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…

Given a graph $G$, we would like to find (if it exists) the largest induced subgraph $H$ in which there are at least $k$ vertices realizing the maximum degree of $H$. This problem was first posed by Caro and Yuster. They proved, for…

Let $d \in \{3, 4, 5, \ldots\}$ and $p \in (0,1]$. We consider the Hermite operator $L = -\Delta + |x|^2$ on its maximal domain in $L^2(\mathbb{R}^d)$. Let $H_L^p(\mathbb{R}^d)$ be the completion of $ \{ f \in L^2(\mathbb{R}^d):…

We examine $p$-groups with the property that every non-normal subgroup has a normalizer which is a maximal subgroup. In particular we show that for such a $p$-group $G$, when $p=2$, the center of $G$ has index at most 16 and when $p$ is odd…

We present a general approach for proving the optimality of the exponents on weighted estimates. We show that if an operator $T$ satisfies a bound like $$ \|T\|_{L^{p}(w)}\le c\, [w]^{\beta}_{A_p} \qquad w \in A_{p}, $$ then the optimal…

We give a sharp bound on the number of triangles in a graph with fixed number of edges. We also characterize graphs that achieve the maximum number of triangles. Using the upper bound on number of triangles, we prove that if $G$ is a…

We develop a new refinement of the Kato's inequality and using this refinement we obtain several upper bounds for the numerical radius of a bounded linear operator as well as the product of operators, which improve the well known existing…

As shown in [A1], the lowest constants appearing in the weak type (1,1) inequalities satisfied by the centered Hardy-Littlewood maximal operator associated to certain finite radial measures, grow exponentially fast with the dimension. Here…

Let $G(n,c/n)$ and $G_r(n)$ be an $n$-node sparse random graph and a sparse random $r$-regular graph, respectively, and let ${\cal I}(n,r)$ and ${\cal I}(n,c)$ be the sizes of the largest independent set in $G(n,c/n)$ and $G_r(n)$. The…

While a number of bounds are known on the zero forcing number $Z(G)$ of a graph $G$ expressed in terms of the order of a graph and maximum or minimum degree, we present two bounds that are related to the (upper) total domination number…