English
Related papers

Related papers: Freiman-Ruzsa-type theory for small doubling const…

200 papers

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.

Number Theory · Mathematics 2013-02-01 Emmanuel Breuillard , Ben Green , Terence Tao

We prove results on the structure of a subset of the circle group having positive inner Haar measure and doubling constant close to the minimum. These results go toward a continuous analogue in the circle of Freiman's $3k-4$ theorem from…

Combinatorics · Mathematics 2018-07-11 Pablo Candela , Anne de Roton

The study of `structure' on subsets of abelian groups, with small `doubling constant', has been well studied in the last fifty years, from the time Freiman initiated the subject. In \cite{DF} Deshouillers and Freiman establish a structure…

Combinatorics · Mathematics 2013-09-24 R. Balasubramanian , Prem Prakash Pandey

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…

Combinatorics · Mathematics 2007-05-23 Ben Green , Terence Tao

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

Number Theory · Mathematics 2017-01-18 G. A. Freiman , O. Serra

The entropic doubling $\sigma_{\operatorname{ent}}[X]$ of a random variable $X$ taking values in an abelian group $G$ is a variant of the notion of the doubling constant $\sigma[A]$ of a finite subset $A$ of $G$, but it enjoys somewhat…

Number Theory · Mathematics 2024-09-05 Ben Green , Freddie Manners , Terence Tao

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…

Number Theory · Mathematics 2023-12-20 Jakub Konieczny

A famous result of Freiman describes the structure of finite sets A of integers with small doubling property. If |A + A| <= K|A| then A is contained within a multidimensional arithmetic progression of dimension d(K) and size f(K)|A|. Here…

Number Theory · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

For $\delta>0$ sufficiently small and $A\subset \mathbb{Z}^k$ with $|A+A|\le (2^k+\delta)|A|$, we show either $A$ is covered by $m_k(\delta)$ parallel hyperplanes, or satisfies $|\widehat{\operatorname{co}}(A)\setminus A|\le c_k\delta |A|$,…

Number Theory · Mathematics 2022-12-07 Peter van Hintum , Hunter Spink , Marius Tiba

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)}.

Number Theory · Mathematics 2010-04-02 Tom Sanders

We give a comprehensive description of the sets $A$ in finite cyclic groups such that $|2A|<\frac94|A|$; namely, we show that any set with this property is densely contained in a (one-dimensional) coset progression. This improves earlier…

Number Theory · Mathematics 2020-10-08 Vsevolod F. Lev

We prove algorithmic versions of the polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Annals of Mathematics, 2025) in additive combinatorics. In particular, we give classical and quantum polynomial-time algorithms that,…

Combinatorics · Mathematics 2025-09-03 Srinivasan Arunachalam , Davi Castro-Silva , Arkopal Dutt , Tom Gur

We show that any set $A$ in $\mathbb F_2^n$ with $|A+A| \le |A|^{2-\eta}$ must intersect a subspace of dimension $O_{\eta}(\log |A|)$ in at least $|A|^{\eta - o(1)}$ elements.

Combinatorics · Mathematics 2025-12-24 Alex Cohen , Dmitrii Zakharov

A non-quantitative version of the Freiman-Ruzsa theorem is obtained for finite stable sets with small tripling in arbitrary groups, as well as for (finite) weakly normal subsets in abelian groups.

Logic · Mathematics 2021-05-24 Amador Martin-Pizarro , Daniel Palacin , Julia Wolf

We obtain quantitative versions of the Balog-Szemeredi-Gowers and Freiman theorems in the model case of a finite field geometry F_2^n, improving the previously known bounds in such theorems. For instance, if A is a subset of F_2^n such that…

Combinatorics · Mathematics 2007-11-13 Ben Green , Terence Tao

We prove a continuous Freiman's $3k-4$ theorem for small sumsets in $\mathbb{R}$ by using some ideas from Ruzsa's work on measure of sumsets in $\mathbb{R}$ as well as some graphic representation of density functions of sets. We thereby get…

Combinatorics · Mathematics 2016-05-17 Anne de Roton

In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of Green and Morris, and of Mazur, we show that the following holds for every fixed $\lambda > 2$…

Combinatorics · Mathematics 2020-10-19 Marcelo Campos , Maurício Collares , Robert Morris , Natasha Morrison , Victor Souza

We prove several new results on the structure of the subgroup generated by a small doubling subset of an ordered group, abelian or not. We obtain precise results generalizing Freiman's 3k-3 and 3k-2 theorems in the integers and several…

Let $\mathbb{A} = (A, \cdot)$ be a semigroup. We generalize some recent results by G. A. Freiman, M. Herzog and coauthors on the structure theory of set addition from the context of linearly orderable groups to linearly orderable…

Combinatorics · Mathematics 2015-02-02 Salvatore Tringali

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

Number Theory · Mathematics 2022-01-14 Dmitrii Zhelezov , Dömötör Pálvölgyi
‹ Prev 1 2 3 10 Next ›