English
Related papers

Related papers: The structure of higher sumsets

200 papers

This paper considers various formulations of the sum-product problem. It is shown that, for a finite set $A\subset{\mathbb{R}}$, $$|A(A+A)|\gg{|A|^{\frac{3}{2}+\frac{1}{178}}},$$ giving a partial answer to a conjecture of Balog. In a…

Combinatorics · Mathematics 2014-01-09 Brendan Murphy , Oliver Roche-Newton , Ilya D. Shkredov

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ...…

Combinatorics · Mathematics 2007-05-23 Jean Bourgain , Mei-Chu Chang

Given a connected graph with domination (or total domination) number \gamma>=2, we ask for the maximum number m_\gamma and m_{\gamma,T} of dominating and total dominating sets of size \gamma. An exact answer is provided for \gamma=2and…

Combinatorics · Mathematics 2013-08-15 Anant Godbole , Jessie Jamieson , William Jamieson

Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = \Omega(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully…

Combinatorics · Mathematics 2023-01-31 Marcelo Campos , Matthew Coulson , Oriol Serra , Maximilian Wötzel

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

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge L. Ramírez Alfonsín , Oystein J. Rodseth

A more sums than differences (MSTD) set is a finite subset S of the integers such that |S+S| > |S-S|. We construct a new dense family of MSTD subsets of {0, 1, 2, ..., n-1}. Our construction gives Theta(2^n/n) MSTD sets, improving the…

Combinatorics · Mathematics 2015-10-26 Yufei Zhao

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

For finite subsets A_1,...,A_n of a field, their sumset is given by {a_1+...+a_n: a_1 in A_1,...,a_n in A_n}. In this paper we study various restricted sumsets of A_1,...,A_n with restrictions of the following forms: a_i-a_j not in S_{ij},…

Combinatorics · Mathematics 2007-05-23 Zhi-Wei Sun , Yeong-Nan Yeh

Let $r$ be a positive integer, and let $A$ be a nonempty finite set of at least two integers. We let $\tilde{C}_r(A)$ denote the {\em asymptotic $r$-covering number} of $A$, that is, the smallest integer value of $l$ for which, for all…

Number Theory · Mathematics 2016-03-22 Bela Bajnok

Let $A_{s,k}(m)$ be the maximum number of distinct letters in any sequence which can be partitioned into $m$ contiguous blocks of pairwise distinct letters, has at least $k$ occurrences of every letter, and has no subsequence forming an…

Combinatorics · Mathematics 2014-09-23 Jesse Geneson

Let $\mathcal{A}$ be a union-closed family of sets with base set $b(\mathcal{A})=\bigcup_{A \in \mathcal{A}}A$ denoted by $[n]=\{1, \cdots, n\}$, and for any real $x>0$, let $\mathcal{A}_{<x} = \{A \in \mathcal{A} \ | \ |A| < x\}$. Also,…

Combinatorics · Mathematics 2025-09-17 Christopher Bouchard

We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved…

Combinatorics · Mathematics 2015-03-31 Sergei Konyagin , Ilya D. Shkredov

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

Given a group $G$, we say that a set $A \subseteq G$ has more sums than differences (MSTD) if $|A+A| > |A-A|$, has more differences than sums (MDTS) if $|A+A| < |A-A|$, or is sum-difference balanced if $|A+A| = |A-A|$. A problem of recent…

Let $A$ be a finite subset of an arbitrary additive group $G$, and let $\phi(A)$ denote the cardinality of the largest subset $B$ in $A$ that is sum-avoiding in $A$ (that is to say, $b_1+b_2 \not \in A$ for all distinct $b_1,b_2 \in B$).…

Combinatorics · Mathematics 2017-01-18 Terence Tao , Van Vu

An $m$-general set in $AG(n,q)$ is a set of points such that any subset of size $m$ is in general position. A $3$-general set is often called a capset. In this paper, we study the maximum size of an $m$-general set in $AG(n,q)$,…

Combinatorics · Mathematics 2022-10-04 Michael Tait , Robert Won

A set ${\cal A} \subseteq \Set{1,...,N}$ is of type $B_2$ if all sums $a+b$, with $a\ge b$, $a,b\in {\cal A}$, are distinct. It is well known that the largest such set is of size asymptotic to $N^{1/2}$. For a $B_2$ set ${\cal A}$ of this…

Number Theory · Mathematics 2007-05-23 Mihail N. Kolountzakis

A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…

Number Theory · Mathematics 2017-12-15 M. N. Huxley , M. C. Lettington , K. M. Schmidt

We consider the multiplicative structure of sets of the form AA+1, where where A is a large, finite set of real numbers. In particular, we show that the additively shifted product set, AA+1 must have a large part outside of any generalized…

Combinatorics · Mathematics 2012-05-23 Steven Senger