English
Related papers

Related papers: Additive Volume of Sets Contained in Few Arithmeti…

200 papers

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

It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set $\mathcal{R}_{\mathbf{Z}}(h,k)= \{|hA|:A \subseteq {\mathbf{Z}} \text{ and } |A|=k\}$ for…

Number Theory · Mathematics 2026-04-07 Melvyn B. Nathanson

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

The study of sums of finite sets of integers has mostly concentrated on sets with small sumsets (Freiman's theorem and related work) and on sets with large sumsets (Sidon sets and $B_h$-sets). This paper considers the sets ${\mathcal…

Number Theory · Mathematics 2026-04-07 Melvyn B. Nathanson

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

Let $A$ be a finite set of $k$ integers. For $h \leq k$, the restricted $h$-fold sumset $h^{\wedge} A$ is the set of all sums of $h$ distinct elements of $A$. In additive combinatorics, much of the focus has traditionally been on finite…

Combinatorics · Mathematics 2025-05-13 Debyani Manna , Mohan , Ram Krishna Pandey

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. Let $f(n,a)$ be the maximum number of sets in a…

Combinatorics · Mathematics 2020-04-14 Brianna Amaral , Lucien Dalton , Drew Polakowski , Annie Raymond , Bertram Thomas

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

Number Theory · Mathematics 2013-04-26 Sándor Z. Kiss , Eszter Rozgonyi , Csaba Sándor

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

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

Combinatorics · Mathematics 2007-05-23 Mei-Chu Chang

A family of sets F is said to be union-closed if A \cup B is in F for every A and B in F. Frankl's conjecture states that given any finite union-closed family of sets, not all empty, there exists an element contained in at least half of the…

Combinatorics · Mathematics 2007-05-23 Robert Morris

A set system is called union closed if for any two sets in the set system their union is also in the set system. Gilmer recently proved that in any union closed set system some element belongs to at least a $0.01$ fraction of sets, and…

Combinatorics · Mathematics 2022-11-22 Zachary Chase , Shachar Lovett

For a compact set $A \subset {\mathbb R}^d$ and an integer $k\ge 1$, let us denote by $$ A[k] = \left\{a_1+\cdots +a_k: a_1, \ldots, a_k\in A\right\}=\sum_{i=1}^k A$$ the Minkowski sum of $k$ copies of $A$. A theorem of Shapley, Folkmann…

Metric Geometry · Mathematics 2021-06-24 Matthieu Fradelizi , Zsolt Lángi , Artem Zvavitch

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 determine the structure of a finite subset $A$ of an abelian group given that $|2A|<3(1-\epsilon)|A|$, $\epsilon>0$; namely, we show that $A$ is contained either in a "small" one-dimensional coset progression, or in a union of fewer than…

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

The union-closed sets conjecture states that if a family of sets $\mathcal{A} \neq \{\emptyset\}$ is union-closed, then there is an element which belongs to at least half the sets in $\mathcal{A}$. In 2001, D. Reimer showed that the average…

Combinatorics · Mathematics 2017-04-25 Abigail Raz

Let G be a finite abelian group of torsion r and let A be a subset of G. The Freiman--Ruzsa theorem asserts that if |A+A| < K|A| then A is contained in a coset of a subgroup of G of size at most r^{K^4}K^2|A|. It was conjectured by Ruzsa…

Combinatorics · Mathematics 2018-06-07 Chaim Even-Zohar , Shachar Lovett

The exponential Freiman dimension of a finite set $A \subset \mathbb{R}^{m}$, introduced by Green and Tao in 2006, represents the largest positive integer $d$ for which $A$ contains the vertices of a non-degenerate $d$-dimensional…

Combinatorics · Mathematics 2025-12-17 Jeck Lim , Akshat Mudgal , Cosmin Pohoata , Xuancheng Shao

For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…

Combinatorics · Mathematics 2023-06-07 Dmitry Krachun , Fedor Petrov

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

Number Theory · Mathematics 2007-05-23 Sinan Gunturk , Melvyn B. Nathanson