Related papers: Sharp inequalities for maximal operators on finite…

For $m \geq 2$, let $(\mathbb{Z}_{m+1}^N, |\cdot|)$ denote the group equipped with the so-called $l^0$ metric, \[ |y| = \left| \big( y(1), \dots, y(N) \big) \right| := | \{1 \leq i \leq N : y(i) \neq 0 \} |,\] and define the…

For $p\in\lbrack2,\infty]$ a mixed Littlewood-type inequality asserts that there is a constant $C_{(m),p}\geq1$ such that \[ \left( \sum_{i_{1}=1}^{\infty}\left( \sum_{i_{2},...,i_{m}=1}^{\infty }|T(e_{i_{1}},...,e_{i_{m}})|^{2}\right)…

We determine the sharp threshold for Hamilton cycles in randomly perturbed sparse graphs. For any $\alpha=\alpha(n)=o(1)$, let $G_{\alpha}$ be an $n$-vertex graph with minimum degree $\delta(G_{\alpha})\ge\alpha n$. We prove that if…

We find the exact value of the best possible constant $C$ for the weak type $(1,1)$ inequality for the one dimensional centered Hardy-Littlewood maximal operator. We prove that $C$ is the largest root of the quadratic equation…

We prove the boundedness of the maximal operator and Hilbert transform along certain variable parabolas in $L^p$ for $p>p_0$ with some $p_0\in (1, 2)$. Connections with the Hilbert transform along vector fields and the polynomial Carleson's…

We show that for every $r \ge 2$ there exists $\epsilon_r > 0$ such that any $r$-uniform hypergraph with $m$ edges and maximum vertex degree $o(\sqrt{m})$ contains a set of at most $(\frac{1}{2} - \epsilon_r)m$ edges the removal of which…

It is well known that if Hardy-Littlewood maximal operator is bounded in space $L^{p(\cdot)}[0;1]$ then $1/p(\cdot)\in BMO^{1/\log}$. On the other hand if $p(\cdot)\in BMO^{1/\log},$ ($1<p_{-}\leq p_{+}<\infty$), then there exists $c>0$…

A sequence $S$ is potentially $K_{p_{1},p_{2},...,p_{t}}$ graphical if it has a realization containing a $K_{p_{1},p_{2},...,p_{t}}$ as a subgraph, where $K_{p_{1},p_{2},...,p_{t}}$ is a complete t-partite graph with partition sizes…

Dependencies of the optimal constants in strong and weak type bounds will be studied between maximal functions corresponding to the Hardy--Littlewood averaging operators over convex symmetric bodies acting on $\mathbb R^d$ and $\mathbb…

We establish new results concerning the existence of extremisers for a broad class of smoothing estimates of the form $\|\psi(|\nabla|) \exp(it\phi(|\nabla|)f \|_{L^2(w)} \leq C\|f\|_{L^2}$, where the weight $w$ is radial and depends only…

For a fixed positive integer $k$ and a graph $G$, let $\lambda_k(G)$ denote the $k$-th largest eigenvalue of the adjacency matrix of $G$. In 2017, Tait and Tobin proved that the maximum $\lambda_1(G)$ among all outerplanar graphs on $n$…

Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $\left\{1, \ldots, n\right\}$ with $m=m(n)$ edges. We show that in the sparse regime, when $\limsup_{n \to \infty} m/n<1$, with high…

Assume that $p\in(1,\infty]$ and $u=P_{h}[\phi]$, where $\phi\in L^{p}(\mathbb{S}^{n-1},\mathbb{R}^{n})$. Then for any $x\in \mathbb{B}^{n}$, we obtain the sharp inequalities $$ |u(x)|\leq…

We study the following two fixed-cardinality optimization problems (a maximization and a minimization variant). For a fixed $\alpha$ between zero and one we are given a graph and two numbers $k \in \mathbb{N}$ and $t \in \mathbb{Q}$. The…

\begin{abstract} In this paper we address the problem of finding the best constants in inequalities of the form: $$ \|\big(|P_+f|^s+|P_-f|^s\big)^{\frac{1}{s}}\|_{L^p({\mathbb{T}})}\leq A_{p,s} \|f\|_{L^p({\mathbb{T}})},$$ where $P_+f$ and…

The toughness of a graph $G$ is defined as the minimum value of $|S|/c(G-S)$ over all cutsets $S$ of $G$ if $G$ is noncomplete, and is defined to be $\infty$ if $G$ is complete. For a real number $t$, we say that $G$ is $t$-tough if its…

We study the linearized maximal operator associated with dilates of the hyperbolic cross multiplier in dimension two. Assuming a Lipschitz condition and a lower bound on the linearizing function, we obtain $L^{p}(\mathbb{R}^{2}) \to…

We prove that there is a constant $c >0$, such that whenever $p \ge n^{-c}$, with probability tending to 1 when $n$ goes to infinity, every maximum triangle-free subgraph of the random graph $G_{n,p}$ is bipartite. This answers a question…

Let $\mathbf{P} \subset [H_0,H]$ be a set of primes, where $\log H_0 \geq (\log H)^{2/3 + \epsilon}$. Let $\mathscr{L} = \sum_{p \in \mathbf{P}} 1/p$. Let $N$ be such that $\log H \leq (\log N)^{1/2-\epsilon}$. We show there exists a subset…

Let $p$ be a prime number and let $G$ be a graph on $n$ vertices and $m$ edges. The zero-sum Ramsey number of $G$ over $\mathbb{Z}_p$, denoted by $R(G, \mathbb{Z}_p)$, is the minimum $\ell\in \mathbb{N}$ such that for any edge-coloring…