Related papers: Double-jump phase transition for the reverse Littl…

We prove a conjecture of Kim and Oum that every proper pivot-minor-closed class of graphs has the strong Erd\H{o}s-Hajnal property. More precisely, for every graph $H$, there exists $\epsilon > 0$ such that every $n$-vertex graph with no…

In this note, we study the emergence of Hamiltonian Berge cycles in random $r$-uniform hypergraphs. For $r\geq 3$, we prove an optimal stopping-time result that if edges are sequently added to an initially empty $r$-graph, then as soon as…

In additive combinatorics, Erd\"{o}s-Szemer\'{e}di Conjecture is an important conjecture. It can be applied to many fields, such as number theory, harmonic analysis, incidence geometry, and so on. Additionally, its statement is quite easy…

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

Let $\Sigma$ be a strictly convex, compact patch of a $C^2$ hypersurface in $\mathbb{R}^n$, with non-vanishing Gaussian curvature and surface measure $d\sigma$ induced by the Lebesgue measure in $\mathbb{R}^n$. The Mizohata--Takeuchi…

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

We consider a sparse linear regression model Y=X\beta^{*}+W where X has a Gaussian entries, W is the noise vector with mean zero Gaussian entries, and \beta^{*} is a binary vector with support size (sparsity) k. Using a novel conditional…

Consider the complete graph \(K_n\) on \(n\) vertices where each edge \(e\) is independently open with probability \(p_n(e)\) or closed otherwise. Here \(\frac{C-\alpha_n}{n} \leq p_n(e) \leq \frac{C+\alpha_n}{n}\) where \(C > 0\) is a…

The Bernoulli convolution with parameter $\lambda\in(0,1)$ is the probability measure $\mu_\lambda$ that is the law of the random variable $\sum_{n\ge0}\pm\lambda^n$, where the signs are independent unbiased coin tosses. We prove that each…

Bollob\'{a}s and Nikiforov (J. Combin. Theory Ser. B. 97 (2007) 859-865) conjectured that for a graph $G$ with $e(G)$ edges and the clique number $\omega(G)$, then $ \lambda_{1}^{2}+\lambda_{2}^{2}\leq…

Let $a_1, \dots, a_n \in \mathbb{R}$ satisfy $\sum_i a_i^2 = 1$, and let $\varepsilon_1, \ldots, \varepsilon_n$ be uniformly random $\pm 1$ signs and $X = \sum_{i=1}^{n} a_i \varepsilon_i$. It is conjectured that $X = \sum_{i=1}^{n} a_i…

Let h_R denote an L ^{\infty} normalized Haar function adapted to a dyadic rectangle R contained in the unit cube in dimension d. We establish a non-trivial lower bound on the L^{\infty} norm of the `hyperbolic' sums $$ \sum _{|R|=2 ^{-n}}…

The conjecture of Brown, Erd\H{o}s and S\'os from 1973 states that, for any $k \ge 3$, if a $3$-uniform hypergraph $H$ with $n$ vertices does not contain a set of $k+3$ vertices spanning at least $k$ edges then it has $o(n^2)$ edges. The…

Let $\lambda$ denote the Liouville function. We prove that $$\sum_{X \leq x < 2X} \sup_{\alpha \in \mathbb{R}/\mathbb{Z}} \bigg\lvert\!\sum_{x \leq n < x+H} \lambda(n) e(n\alpha)\bigg\rvert = o(HX)$$ as $X\to \infty$, in the regime $H =…

Attach to each edge of the complete graph on $n$ vertices, i.i.d. exponential random variables with mean $n$. Aldous [1] proved that the longest path with average weight below $p$ undergoes a phase transition at $p=\frac{1}{e}$: it is…

The purpose of this paper is twofold. First, we provide an optimal $\Omega(\sqrt{n})$ bits lower bound for any two-way protocol for the Vector in Subspace Communication Problem which is of bounded total rank. This result complements Raz's…

We prove a conjecture dating back to a 1978 paper of D.R.\ Musser~\cite{musserirred}, namely that four random permutations in the symmetric group $\mathcal{S}_n$ generate a transitive subgroup with probability $p_n > \epsilon$ for some…

We explore the supercritical phase of the vertex-reinforced jump process (VRJP) and the $\mathbb{H}^{2|2}$-model on rooted regular trees. The VRJP is a random walk, which is more likely to jump to vertices on which it has previously spent a…

For the last passage percolation (LPP) on $\mathbb{Z}^2$ with exponential passage times, let $T_{n}$ denote the passage time from $(1,1)$ to $(n,n)$. We investigate the law of iterated logarithm of the sequence $\{T_{n}\}_{n\geq 1}$; we…

For every unit vector $\sigma\in\Sigma_{d-1}$ and every $r\ge0$, let % % \begin{displaymath} P_{\sigma,r}=[-1,1]^d\cap\{t\in\Rr^d:t\cdot\sigma\le r\} \end{displaymath} % % denote the intersection of the cube $[-1,1]^d$ with a half-space…