English
Related papers

Related papers: A strengthening of Freiman's 3k-4 theorem

200 papers

The $3k-4$ Theorem is a classical result which asserts that if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with \begin{equation}\label{hyp}|A+B|=|A|+|B|+r\leq |A|+|B|+\min\{|A|,\,|B|\}-3-\delta,\end{equation} where $\delta=1$ if…

Number Theory · Mathematics 2019-12-02 David J. Grynkiewicz

Freiman's $3k-4$ Theorem states that if a subset $A$ of $k$ integers has a Minkowski sum $A+A$ of size at most $3k-4$, then it must be contained in a short arithmetic progression. We prove a function field analogue that is also a…

Number Theory · Mathematics 2024-10-01 Alain Couvreur , Gilles Zémor

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

Let A be a finite set of integers. We prove that if |A| is at least 2 and |A+A| is 3|A|-3, then one of the following is true: 1. A is a bi-arithmetic progression; 2. A+A contains an arithmetic progression of length 2|A|-1; 3. |A| is 6 and A…

Number Theory · Mathematics 2013-08-06 Renling Jin

For $A\subseteq \mathbb{R}$, let $A+A=\{a+b: a,b\in A\}$ and $AA=\{ab: a,b\in A\}$. For $k\in \mathbb{N}$, let $SP(k)$ denote the minimum value of $\max\{|A+A|, |AA|\}$ over all $A\subseteq \mathbb{N}$ with $|A|=k$. Here we establish…

Combinatorics · Mathematics 2025-01-29 Ginny Ray Clevenger , Haley Havard , Patch Heard , Andrew Lott , Alex Rice , Brittany Wilson

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

Number Theory · Mathematics 2024-02-26 David J. Grynkiewicz

We prove a robust version of Freiman's $3k - 4$ theorem on the restricted sumset $A+_{\Gamma}B$, which applies when the doubling constant is at most $\tfrac{3+\sqrt{5}}{2}$ in general and at most $3$ in the special case when $A = -B$. As…

Number Theory · Mathematics 2020-03-03 Xuancheng Shao , Max Wenqiang Xu

In this paper we give a very elementary proof that if A and B are subsets of {1,2,...,N}, each having at least 5N^{1 - (4(k-1))^{-1}} elements, then the sumset A+B has a k-term arithmetic progression.

Number Theory · Mathematics 2007-05-23 Ernie Croot

One of the many theorems Freiman proved, in the second half of the twentieth century, in the subject which later came to be known as "structure theory of set addition", was 'Freiman's $3k-4$ theorem' for subsets of $\Z$. In this article we…

Combinatorics · Mathematics 2017-08-22 R. Balasubramanian , Prem Prakash Pandey

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

A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$…

Number Theory · Mathematics 2018-08-28 Gregory A. Freiman , Oriol Serra , Christoph Spiegel

We show two results. First, a refinement of Freiman's theorem: if A is a finite set of integers and |A+A| < K|A|, then A is contained in a multidimensional progression of dimension at most O(K^{7/4} log^3K) and size at most exp(O(K^{7/4}…

Classical Analysis and ODEs · Mathematics 2010-11-02 Tom Sanders

Let $k\geqslant 3$ and let $A=\{0=a_{0}<a_{1}<\cdots<a_{k-1}\}$ with $\gcd(A)=1$. Freiman-Lev conjecture [V.F. Lev, Restricted set addition in groups, I. The classical setting, J. London Math. Soc. 62(2000), 27-40] is a well-known…

Number Theory · Mathematics 2024-09-04 Yujie Wang , Min Tang

For a nonempty finite set $A$ of integers, let $S(A) = \left\{ \sum_{b\in B} b: \emptyset \not= B\subseteq A\right\}$ be the set of all nonempty subset sums of $A$. In 1995, Nathanson determined the minimum cardinality of $S(A)$ in terms of…

Number Theory · Mathematics 2024-02-13 Mohan , Jagannath Bhanja , Ram Krishna Pandey

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

We show that if A is a large subset of a box in Z^d with dimensions L_1 >= L_2 >= ... >= L_d which are all reasonably large, then |A + A| > 2^{d/48}|A|. By combining this with Chang's quantitative version of Freiman's theorem, we prove a…

Number Theory · Mathematics 2007-05-23 Ben Green

Freiman's 2.4-Theorem states that any set $A \subset \mathbb{Z}_p$ satisfying $|2A| \leq 2.4|A| - 3 $ and $|A| < p/35$ can be covered by an arithmetic progression of length at most $|2A| - |A| + 1$. A more general result of Green and Ruzsa…

Combinatorics · Mathematics 2018-06-01 Pablo Candela , Oriol Serra , Christoph Spiegel

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

We study the extent to which sets A in Z/NZ, N prime, resemble sets of integers from the additive point of view (``up to Freiman isomorphism''). We give a direct proof of a result of Freiman, namely that if |A + A| < K|A| and |A| < c(K)N…

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

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

Combinatorics · Mathematics 2014-02-25 Antal Balog , Oliver Roche-Newton
‹ Prev 1 2 3 10 Next ›