Related papers: Formulations of the PFR Conjecture over $\mathbb{Z…

The Polynomial Freiman-Ruzsa conjecture is one of the central open problems in additive combinatorics. If true, it would give tight quantitative bounds relating combinatorial and algebraic notions of approximate subgroups. In this note, we…

We study two conjectures in additive combinatorics. The first is the polynomial Freiman-Ruzsa conjecture, which relates to the structure of sets with small doubling. The second is the inverse Gowers conjecture for $U^3$, which relates to…

The well--known Freiman--Ruzsa Theorem provides a structural description of a set $A$ of integers with $|2A|\le c|A|$ as a subset of a $d$--dimensional arithmetic progression $P$ with $|P|\le c'|A|$, where $d$ and $c'$ depend only on $c$.…

Ruzsa's conjecture asserts that any sequence $(a_n)_{n \geq 0}$ of integers that preserves congruences, $\textit{i.e.}$, satisfies $ a_{n+k} \equiv a_n \mod k $, and has the growth condition $\limsup_{n \to +\infty} |a_n|^{1/n} < e$, must…

We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…

We prove a conjecture of K. Marton, widely known as the polynomial Freiman--Ruzsa conjecture, in characteristic $2$. The argument extends to odd characteristic, with details to follow in a subsequent paper.

We settle the Polynomial Freiman--Ruzsa (PFR/Marton) conjecture for the integers and for cyclic groups. More precisely, we show that if $A$ is a finite subset of $\mathbb{Z}$ or $\mathbb{Z}/N\mathbb{Z}$ with $|A+A| \le K|A|$, then there is…

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

Let $p$ be a prime. One formulation of the Polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p$ can be stated as follows. If $\phi : \mathbb{F}_p^n \rightarrow \mathbb{F}_p^N$ is a function such that $\phi(x+y) - \phi(x) - \phi(y)$ takes…

Recently Breuillard and Tointon showed that one reasonable formulation of the polynomial Freiman-Ruzsa conjecture fails for nonabelian groups. We improve and simplify their construction.

Even though Zaremba's conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy the strong version of the conjecture, all of…

A conjecture of Marton, widely known as the polynomial Freiman-Ruzsa conjecture, was recently proved by Gowers, Green, Manners and Tao for any bounded-torsion Abelian group $G$. In this paper we show a few simple modifications that improve…

A recent conjecture by I. Ra\c{s}a asserts that the sum of the squared Bernstein basis polynomials is a convex function in $[0,1]$. This conjecture turns out to be equivalent to a certain upper pointwise estimate of the ratio…

We show that the Freiman--Ruzsa theorem, characterising finite sets with bounded doubling, leads to an alternative proof of a characterisation of Meyer sets, that is, relatively dense subsets of Euclidean spaces whose difference sets are…

Motivated by the Polynomial Freiman-Ruzsa (PFR) Conjecture, we develop a theory of locality in sumsets, with applications to John-type approximation and sets with small doubling. First we show that if $A \subset \mathbb{Z}$ with $|A+A| \le…

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…

Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asyptotically sharp version of Freiman's theorem in F_2^n: if A in F_2^n is a set for which |A + A| <= K|A| then A is…

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

We point out that the recursive formula that appears in Erickson's presentation "Fusible Numbers" is incorrect, and pose an alternate conjecture about the structure of fusible numbers. Although we are unable to solve the conjecture, we…

We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing…