Questions on the subject additive combinatorics, also known as arithmetic combinatorics, such as questions on: additive bases, sum sets, inverse sum set theorems, sets with small doubling, Sidon sets, Szemerédi's theorem and its ramifications, Gowers uniformity norms, etc. Often combined with the ...

learn more… | top users | synonyms

0
votes
0answers
47 views

When are these sums consecutive integers? [closed]

It is possible to construct $\frac{n(n-1)}{2}$ sums which each contain two distinct summands chosen from a set $n$ numbers. For which $n\geq 3$ do there exist a set of $n$ (distinct) integers such ...
8
votes
1answer
112 views

Small set such that $\{1 , \ldots , n\} \cdot A = \mathbb{Z} / p \mathbb{Z}$

Let $p$ be a large prime and $n < p$. What is the smallest size of a set $A \subset \mathbb{Z} / p \mathbb{Z}$ such that $A \cdot \{1 , \ldots , n\} = \mathbb{Z} / p \mathbb{Z}$? Here $\cdot$ ...
0
votes
0answers
20 views

Is budget-additive function a modular set function?

We know that budget-additive function $$ f(S) = \min\{B,\sum_{i \in S}w_i\} $$ where $w_i$ is positive constant and $B \ge 0$ is called additive budget. Is it also a modular set function?
1
vote
1answer
201 views

Approximation of sets

Is the following true? For every $\varepsilon>0$ there is a finite subset $W$ of $\mathbb{N}\times \mathbb{N}\times \mathbb{N}$, such that $$|p_1(W)\cap p_2(W)\cap \{p_1(x)+p_2(x):x\in W\}\cap \{...
1
vote
1answer
320 views

On Sylvester's coin problem for geometric progressions

Given $a,b\in\Bbb N$ we know from http://www.emis.ams.org/journals/INTEGERS/papers/i33/i33.pdf that the smallest number that cannot be written as a non-negative linear combination of integers with ...
8
votes
0answers
261 views

What is intuition behind sets with more sums than differences?

There exist finite sets $A$ in, say, $\mathbb{Z}$, such that $|A+A|>|A-A|$. The minimal such set contains 8 elements and consists of, say, 0, 2, 3, 4, 7, 11, 12, 14. How should I find such an ...
4
votes
0answers
98 views

Restricted addition analogue of Freiman's $(3n-4)$-theorem

There is a well-known theorem of Freiman saying that if $A$ is a finite set of integers with $|2A| \le 3|A|-4$, then $A$ is contained in an arithmetic progression with at most $|2A|-|A|+1$ terms. Is ...
0
votes
0answers
40 views

When does the equality hold in Dias da Silva - Hamidoune Theorem?

Let $p$ be prime number and let $A$ be a $k$-elements subset of $\mathbb{Z}/p\mathbb{Z}$. Dias da Silva - Hamidoune Theorem states that $|h^{\hat{}}A| \geq \min(p, hk -h^2 + 1)$, where $h$ is an ...
0
votes
1answer
107 views

Sumset achieving extreme upper bound [closed]

It is trivial that $|A_1 + \cdots + A_h| \leq |A_1|\cdots |A_h|$, where $h \geq 2$ and $A_i \subseteq \mathbb{Z}$ are nonempty finite sets and $A_1 + \cdots + A_h :=\{a_1 + \cdots + a_h : a_i \in A_i ~...
3
votes
1answer
124 views

Lower bound construction for Multidimensional Szemerédi's Theorem

The Multidimensional version of Szemerédi's theorem given by Theorem 10.2 in Tim Gower's paper from 2007 has the following statement. Let $\delta>0$ and $k\in\mathbb{N}$. Then if $N$ is ...
1
vote
0answers
52 views

On structure of patterns of subset sums?

There are roughly $2^{nm}$ choices of sets of $m$ distinct integers in $[-2^n,2^n]$ (after fixing ordering). Each set of $m$ integers has $2^m$ subsets. Suppose we assign $\{0,1\}$ value to each ...
6
votes
1answer
214 views

Is the exponent $2$ sharp in the Balog-Szemerédi-Gowers Theorem?

The Balog-Szemerédi-Gowers theorem can be stated in the following form: let $A,B$ be subsets of $\mathbb{Z}/n\mathbb{Z}$ (say) with equal cardinality, such that $$ \|1_A*1_B\|_2 \ge K^{-1} \|1_A\|_1 \|...
15
votes
1answer
336 views

Combinatorics problem about sum of natural numbers

Following combinatorics problem is claimed to be an open problem in "The Princeton Companion to Mathematics" (pp. 6) Let $a_1,a_2,a_3,...$ be a sequence of positive integers, and suppose that each ...
3
votes
1answer
178 views

Find a subset such that its sum is divisible by $n$

It is said that the following proposition is true. $\forall S \subset \mathbb{Z}, |S| = 2n-1.\ \exists A \subset S, |A| = n$ which satisfies $$ n \ | \ \sum_{a \in A}a. $$ Could someone gives a ...
8
votes
0answers
144 views

Sets of natural numbers which are almost closed under addition

I am interested in a classification of sets $A \subseteq \mathbb{N}$ such that for all $k \in A$, $d( A+k \cap \mathbb{N} \setminus A) = 0$ where $d$ is the asymptotic density and $A+k = \{n \in \...
0
votes
0answers
79 views

Embedding a cancellative monoid into another in such a way that $|X-x|=|X|$, where $X$ is a fixed finite set and $x\in X$

Preliminaries. Let $\mathbb A = (A, +)$ be a possibly non-commutative semigroup. For $X, Y \subseteq A$ we set $$ X - Y := \{a \in A: a + y \in X\text{ for some }y \in Y\}, $$ which is just the usual ...
1
vote
1answer
93 views

Does positive relative density imply asymptotic additive basis behaviour?

First definitions: let $A, B \ \subset \mathbb{Z_{>0}}$ and $1\in A, 1\in B$. We define the relative density of $A$ with respect to $B$ to be $$rel(A, B) = \inf_n \frac{|A \cap [1,n]|}{| B \cap [1,...
9
votes
1answer
286 views

Largeness and arithmetic progression properties of generic reals

Consider the following properties for a subset $A$ of $\mathbb{N}$: (1) $A$ is large: $\sum_{n \in A}$$ 1\over n$$=\infty,$ (2) $A^\infty=\limsup \frac{|A \cap \{ 1, \dots, n\}|}{n} >0$, (3) $A_\...
5
votes
1answer
240 views

Zero-sum sets in union-closed families

The Davenport constant $D(G)$ of a finite abelian group $G$ is the minimum integer $n$ such that whenever $a_1, \ldots, a_n \in G$ (not necessarily distinct), there is a non-empty $I \subseteq [n]$ ...
3
votes
1answer
127 views

3-dimensional vectors satisfying certain equalities

Question: Are there 5 distinct vectors $u,v,w,x,y \in \mathbb{R}^3$, all on the unit sphere (i.e. $||u||=||v||=||w||=||x||=||y||=1$), such that: $||u+v+x||=||u+v+y||=||u+w+x||=||u+w+y||=1$ ? Also, ...
13
votes
3answers
1k views

A seemingly simple combinatorial object that must have an easy generating function

One more question related to my earlier "Special" meanders. I am trying to isolate simplest problems related to it. Here is one. For a composition (i. e. a tuple of natural numbers) $\...
7
votes
1answer
358 views

Does $|A+A|$ concentrate near its mean?

Fix $N$ to be a large prime. Let $A \subset \mathbb{Z}/N\mathbb{Z}$ be a random subset defined by $\mathbb{P}(a \in A) = p$, where $p = N^{-2/3 + \epsilon}$ for some fixed $\epsilon > 0$. My ...
4
votes
0answers
228 views

The original proof of Szemerédi's Theorem

Nowadays there are plenty of different proofs of the celebrated Szemerédi's Theorem but for historical reasons I would like to read and understand the original proof. The proof is very tricky and, for ...
6
votes
1answer
112 views

Are the extremal points of a certain set of functions $\mathcal P(\mathbf N) \to \bf R$ weakly additive?

Let an upper density (on $\mathbf N$) be a (set) function $f: \mathcal P(\mathbf N) \to \mathbf R$ such that, for all $X, Y \subseteq \bf N$ and $h,k \in \mathbf N^+$, the following hold: (F1) $f(\...
3
votes
1answer
164 views

Freiman-isomorphic sets

Haw can we prove that an arbitrary set $A$ of $n$ positive integers is 2-Freiman isomorphic to a subset of {$ 1,2,...,4^{n}$} and $4^{n}$ cannot be improved to $2^{n}$?
4
votes
1answer
165 views

Reference to a variant of Abel's summation formula

Edit. A stronger version of the formula is true (details follow). Let $(a_n)_{n \ge 1}$ be a sequence of complex numbers, $(\lambda_n)_{n \ge 1}$ a nondecreasing sequence of positive reals such that $...
2
votes
1answer
58 views

l-wise t-intersecting families of shifts of finite sets of integers

Let $A$ be a finite set of non-negative integers and write $I_k$ for the set ${0,1,\ldots,k-1}$. Form all possible l-wise intersections $(A+k_1)\cap \ldots \cap (A+k_l)$, where each $k_i$ runs through ...
3
votes
2answers
119 views

Partition regular systems: do they have solution in (very dense) set of integers?

A partition regular system is a linear system of equations of the form $A\cdot x=0$, which satisfies a Ramsey-type result (namely, that for each $r>0$ whenever we colour the integers in $r$ classes,...
1
vote
1answer
256 views

Some divisibility constraints in Frobenius coin problem

Let's say that the linear form $ax+by$ represents $n$ if $ax+by=n$ for some positive integer $x$ and $y$. Call a pair $(a,b)\in\Bbb N\times\Bbb N$ with $\mathsf{gcd}(a,b)=1$ excellent if linear form ...
2
votes
1answer
100 views

Intersections of translates of finite sets of integers

I am searching for a result in the literature that I am sure must be known, but I just fail to find it. Let us starts with a simple example: Let $A, B\subset \mathbb{Z}$ be a finite sets of integers ...
3
votes
1answer
267 views

Problem related to Frobenius coin problem

Let's say that the linear form $ax+by$ represents $n$ if $ax+by=n$ for some positive integer $x$ and $y$. Call a pair $(a,b)\in\Bbb N\times\Bbb N$ with $\mathsf{gcd}(a,b)=1$ good if, for any $r,s,u,...
1
vote
0answers
84 views

Consecutive integers divisible by consecutive small numbers

Given $n$, what is the largest set of consecutive integers in $[n,2n]$ can we have so that each integer is divisible by a distinct element from $[\log n,2\log n]$ (no partiular order)? So apriori I am ...
5
votes
0answers
71 views

Some questions about the Lévy monoid of certain densities

Let $\bf H$ be a set, $f: \mathcal P({\bf H}) \rightharpoonup \bf R$ a partial function, and $\mathcal{D}$ the domain of $f$. Next, denote by $\mathcal M(f)$ the set of all (total) functions $\theta: ...
0
votes
0answers
55 views

$\mathsf{GCD}$s of random linear form

Given $a,b\in\Bbb N_{<M}$ where $M\in\Bbb N_{>\exp(18)}$ is arbitrary with $(a,b)=1$, the probability that $\mathsf{gcd}(ax_1+by_1,ax_2+by_2)=1$ where $x_1,x_2,y_1,y_2\in\Bbb N_{>\ln M}$ is ...
3
votes
1answer
148 views

Exact statistics in the Frobenius coin problem

The Frobenius coin problem guarantees that if $(a,b)=1$, then $$ax+by$$ does not represent exactly $\frac{(a-1)(b-1)}2$ numbers all below $g(a,b)=ab-a-b$ if $x,y\geq0$ holds. Assume $m\in[0,ab-a-b]$ ...
8
votes
0answers
216 views

An abstract zero-sum problem

I would like to know whether the problem described below has appeared in the literature and/or whether similar questions have been studied. I would be very happy to find some references or, if none ...
12
votes
1answer
831 views

Where did the term “additive energy” originate?

A fundamental object in modern additive combinatorics and harmonic analysis is additive energy. Given a subset $A$ of (say) an abelian group $G$ the additive energy of $A$ is defined to be the ...
9
votes
0answers
301 views

A characterization of quadratics similar to an inverse sieve problem

Suppose $\mathscr{A} \subset \mathbb{N}$ enjoys for all large enough cutoffs $X$ the following properties: $|\mathscr{A} \cap [1,X]| > \sqrt{X}/10$; and the discriminant $\prod_{\alpha \neq \beta}...
8
votes
0answers
217 views

Partition regularity in the squares

A linear equation $c_1x_1 + \cdots + c_sx_s = 0$ is partition regular if for every partition of the natural numbers into colour classes $A_1, \ldots, A_r$, there is a solution to the equation in which ...
5
votes
0answers
188 views

Is $AA+A$ always at least as large as $A/A$?

Let $A$ be a finite set of real numbers. Is it always the case that $|AA+A| \geq |A/A|$? In the line above, $AA+A:=\{ab+c:a,b,c \in A \}$, while $A/A:=\{a/b:a,b \in A, b\neq 0 \}$ is the ratio set. ...
6
votes
1answer
278 views

Subsets of [1..N] with no three-term arithmetic progressions and no large gaps

Let S be a subset of [1..N] containing no three-term arithmetic progression, and let h(S) be the size of the largest gap between two consecutive elements of S. By Roth's theorem, h(S) has to grow ...
6
votes
2answers
271 views

Additive energy of Piatetski-Shapiro sequences

Let $c>1$, and let $A$ denote the set $$ \Big\{ \lfloor n^c \rfloor, \quad 1 \leq n \leq N \Big\}. $$ Thus $A$ consists of the first $N$ elements of a so-called Piatetski-Shapiro sequence. The ...
1
vote
1answer
155 views

limit and combinatorics

Given $x \in (0,\frac{1}{2})$ and $y \in (0,\frac{1}{2}]$, what is the value of the following limit: $\lim_{n\rightarrow \infty}\sum_{k=0}^{n}{n \choose k}|x^{n-k}(1-x)^{k}-y^{n-k}(1-y)^{k}|?$ When $...
2
votes
0answers
115 views

Additive combinatorics and a Diophantine equation

Let $(n_k)_{1 \leq k \leq N}$ be a sequence of distinct positive integers. For $v \in \mathbb{Z}$ set $$ A_N(v) = \# \Big\{ (k,\ell) \in \{1, \dots, N\}^2, ~k \neq \ell:\quad n_k - n_\ell = v \Big\}. $...
14
votes
1answer
539 views

Erdös-Turán via Hardy-Littlewood circle method?

For any set $B\subseteq \mathbb{N}$ one can associate the formal series $$f_B(z) = \sum_{b\in B}z^b$$ and obtain $$f_B(z)^k = \sum_{n\geqslant 0} r_{B,k}(n)z^n,$$ where $r_{B,k}(n) = |\{(x_1,\cdots,...
3
votes
2answers
332 views

Is the sumset or the sumset of the square set always large?

Let A be a finite subset of $\mathbb{N}$, $\mathbb{R}$, or a sufficiently small subset of $\mathbb{F}_{p}$. Do we have a lower bound of the form $|A|^{1+\delta}$ on the following quantity: $$\max (|\...
6
votes
1answer
314 views

Additivity of upper densities with respect to arithmetic progressions of integers

Let $\mathsf{d}^\star$ be the asymptotic upper density, defined on the power set of positive integers $\mathbf{N}^+$, so that $$ \mathsf{d}^\star\colon \mathcal{P}(\mathbf{N}^+) \to\mathbf{R}\colon X\...
3
votes
0answers
211 views

Area defined with $\pm$ closedness

Denote $B_n\subset\Bbb R^n$ to be unit ball at origin. Denote $S\subset B_n$ to region of type $\mathsf I$ if it satisfies $$s\in S\iff\forall t\in S, s+t\in S\mbox{ or }s-t\in S$$ I am convinced $\...
18
votes
0answers
503 views

Which sets of roots of unity give a polynomial with nonnegative coefficients?

The question in brief:   When does a subset $S$ of the complex $n$th roots of unity have the property that $$\prod_{\alpha\, \in \,S} (z-\alpha)$$ gives a polynomial in $\mathbb R[z]$ with ...
6
votes
1answer
294 views

What pairs of sets have additive energy?

In an abelian group, the additive energy between two sets is $$E(A,B)=|\{(a_1,a_2,b_1,b_2) \in A\times A\times B\times B:a_1+b_1=a_2+b_2\}|$$ which is ranges from $|A||B|$ to $(|A||B|)^{3/2}$. What I ...