Related papers: Algorithmic Polynomial Freiman-Ruzsa Theorems

We provide algorithmic versions of the Polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Ann. of Math., 2025). In particular, we give a polynomial-time algorithm that, given a set $A \subseteq \mathbb{F}_2^n$ with…

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…

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…

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…

In this paper, we study the linear structure of sets $A \subset \mathbb{F}_2^n$ with doubling constant $\sigma(A)<2$, where $\sigma(A):=\frac{|A+A|}{|A|}$. In particular, we show that $A$ is contained in a small affine subspace. We also…

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$.…

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…

We show that if A is a subset of F_2^n and |A+A| < K|A| then A is contained in a subspace of size at most 2^{O(K^{3/2}log K)}|A|. This improves on the previous best of 2^{O(K^2)}.

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 give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has had far-reaching implications in additive combinatorics. We…

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…

We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Fre\u{i}man dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 K))$. This can be thought of…

Let A be a subset of a group G = (G,.). We will survey the theory of sets A with the property that |A.A| <= K|A|, where A.A = {a_1 a_2 : a_1, a_2 in A}. The case G = (Z,+) is the famous Freiman--Ruzsa theorem.

We introduce a new notion of sparsification, called \emph{strong sparsification}, in which constraints are not removed but variables can be merged. As our main result, we present a strong sparsification algorithm for 1-in-3-SAT. The…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

We prove some new instances of a conjecture of Bachoc, Couvreur and Z\'emor that generalizes Freiman's $3k-4$ Theorem to a multiplicative version in a function field setting. As a consequence we find that if $F$ is a rational function field…

We formulate a nonrecursive combinatorial rule for the expansion of the stable Grothendieck polynomials of [Fomin-Kirillov '94] in the basis of stable Grothendieck polynomials for partitions. This gives a common generalization, as well as…

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…