English
Related papers

Related papers: The Typical Structure of Sets with Small Sumset

200 papers

Given a finite set of integers $A$, its sumset is $A+A:= \{a_i+a_j \mid a_i,a_j\in A\}$. We examine $|A+A|$ as a random variable, where $A\subset I_n = [0,n-1]$, the set of integers from 0 to $n-1$, so that each element of $I_n$ is in $A$…

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…

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

In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…

Number Theory · Mathematics 2013-04-23 Darren Glass

For any finite set of integers X, define its sumset X+X to be {x+y: x, y in X}. In a recent paper, Martin and O'Bryant investigated the distribution of |A+A| given the uniform distribution on subsets A of {0, 1, ..., n-1}. They also…

Number Theory · Mathematics 2012-12-24 Oleg Lazarev , Steven J. Miller , Kevin O'Bryant

The average value of log s(n)/n taken over the first N even integers is shown to converge to a constant lambda when N tends to infinity; moreover, the value of this constant is approximated and proven to be less than 0. Here s(n) sums the…

Number Theory · Mathematics 2009-12-21 Wieb Bosma , Ben Kane

Experimental calculations suggest that the $h$-fold sumset sizes of 4-element sets of integers are concentrated at $h$ numbers that are differences of tetrahedral numbers. In this paper it is proved that these "popular" sumset sizes always…

Number Theory · Mathematics 2025-08-29 Melvyn B. Nathanson

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

Given two identical linear codes $\mathcal C$ over $\mathbb F_q$ of length $n$, we independently pick one codeword from each codebook uniformly at random. A $\textit{sumset}$ is formed by adding these two codewords entry-wise as integer…

Information Theory · Computer Science 2016-07-05 Jingge Zhu , Michael Gastpar

For $n \geq 225$ we show that every integer of the form $n + 2m$ such that $0 \leq 2m \leq n^{2} - \frac{9}{2} n \sqrt{n}$ is the dimension of a connected semi-simple subalgebra of $\mathrm{M}_{n}(k)$, that is, a subalgebra isomorphic to a…

Combinatorics · Mathematics 2019-08-19 Phillip Heikoop , Padraig Ó Catháin

We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.

Number Theory · Mathematics 2007-05-23 Jozsef Solymosi

The sumset is one of the most basic and central objects in additive number theory. Many of the most important problems (such as Goldbach's conjecture and Fermat's Last theorem) can be formulated in terms of the sumset $S + S = \{x+y :…

Number Theory · Mathematics 2014-01-21 Steven J. Miller , Kevin Vissuet

Motivated by questions asked by Erdos, we prove that any set $A\subset{\mathbb N}$ with positive upper density contains, for any $k\in{\mathbb N}$, a sumset $B_1+\cdots+B_k$, where $B_1,\dots,B_k\subset{\mathbb N}$ are infinite. Our proof…

Dynamical Systems · Mathematics 2024-02-23 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

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

A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B_2[g]-set is a set A of integers such that no integer has…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

For a subset $A$ of an abelian group $G$, given its size $|A|$, its doubling $\kappa=|A+A|/|A|$, and a parameter $s$ which is small compared to $|A|$, we study the size of the largest sumset $A+A'$ that can be guaranteed for a subset $A'$…

Combinatorics · Mathematics 2022-10-14 Jacob Fox , Sammy Luo , Huy Tuan Pham , Yunkun Zhou

The normal covering number $\gamma(G)$ of a finite group $G$ is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for $\gamma(S_n)$ and $\gamma(A_n)$ depending on the arithmetic structure of…

Group Theory · Mathematics 2025-08-04 Sean Eberhard , Connor Mellon

Let $\gg$ be a complex reductive Lie algebra and $\kk\subset\gg$ be any reductive in $\gg$ subalgebra. We call a $(\gg,\kk)$-module $M$ bounded if the $\kk$-multiplicities of $M$ are uniformly bounded. In this paper we initiate a general…

Representation Theory · Mathematics 2007-10-05 Ivan Penkov , Vera Serganova

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

Combinatorics · Mathematics 2018-12-27 Ishay Haviv