Related papers: On the threshold for Szemer\'edi's theorem with ra…

There is a long history of establishing central limit theorems for Markov chains. Quantitative bounds for chains with a spectral gap were proved by Mann and refined later. Recently, rates of convergence for the total variation distance were…

We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…

For every $n\geq 27$, we show that the number of $n/(n-1)^+$-free words (i.e., threshold words) of length $k$ on $n$ letters grows exponentially in $k$. This settles all but finitely many cases of a conjecture of Ochem.

Kupavskii proved a codegree version of the Erd\H{o}s--Ko--Rado theorem by showing that for an intersecting family $\mathcal{F} \subseteq \binom{[n]}{k}$ with $n \geq 2k +3d/(1-d/k)$, the minimum $d$-degree of $\mathcal{F}$ is at most…

Let $S$ be a subset of $\{1,\ldots,N\}$ avoiding the nontrivial progressions $x, x+y^2-1, x+ 2(y^2-1)$. We prove that $|S|\ll N/\log_m{N}$, where $\log_m $ is the $m$-fold iterated logarithm and $m\in\mathbf{N}$ is an absolute constant.…

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

We investigate threshold-based multi-trial decoding of concatenated codes with an inner Maximum-Likelihood decoder and an outer error/erasure (L+1)/L-extended Bounded Distance decoder, i.e. a decoder which corrects e errors and t erasures…

The purpose of this paper is to study a one-dimensional polymer penalized by its range and placed in a random environment $\omega$. The law of the simple symmetric random walk up to time $n$ is modified by the exponential of the sum of…

Let $(Z_n)$ be a supercritical branching process in a random environment $\xi = (\xi_n)$. We establish a Berry-Esseen bound and a Cram\'er's type large deviation expansion for $\log Z_n$ under the annealed law $\mathbb P$. We also improve…

In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…

This article gives an overview of the emerging literature on large deviations for random graphs. Written for the general mathematical audience, the article begins with a short introduction to the theory of large deviations. This is followed…

This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…

An extension of Szemer\'edi's Theorem is proved for sets of positive density in approximate lattices in general locally compact and second countable abelian groups. As a consequence, we establish a recent conjecture of Klick, Strungaru and…

We study the quantity $$ \tau_{n,k}:=\frac{|T_n^{(k)}(\omega_{n,k})|}{T_n^{(k)}(1)}\,, $$ where $T_n$ is the Chebyshev polynomial of degree $n$, and $\omega_{n,k}$ is the rightmost zero of $T_n^{(k+1)}$. Since the absolute values of the…

The symmetric case of the Szemer\'edi-Trotter theorem says that any configuration of $N$ lines and $N$ points in the plane has at most $O(N^{4/3})$ incidences. We describe a recipe involving just $O(N^{1/3})$ parameters which sometimes…

We study circuit codes with long bit runs (sequences of distinct transitions) and derive a formula for the maximum length for an infinite class of symmetric circuit codes with long bit runs. This formula also results in an improved lower…

We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…

In this work, we prove new results concerning the combinatorial properties of random linear codes. Firstly, we prove a lower bound on the list-size required for random linear codes over $\mathbb F_q$ $\varepsilon$-close to capacity to…

Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural multi-dimensional extension of the theorem of…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…