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 top-level tags nt.number-theory or co.combinatorics. Some additional tags are available for further specialization, including the tags sumsets and sidon-sets.

507 questions
Filter by
Sorted by
Tagged with
123 views

### For any $n-1$ elements of $\mathbb Z/n\mathbb Z$, we can make $0$ using $\{-,+,\times\}$ without parentheses

MSE: Just using $+$ ,$-$, $\times$ using any given n-1 integers, can we make a number divisible by n? (no brackets allowed) Is there any hope in proving the following? (Cross-posted here after a ...
169 views

### Difference set of difference set

I am a hobby computer scientist and searching for an algorithm to construct a set of n numbers (integers) with certain properties. Property 1 / Step 1 All pairwise differences of the elements should ...
130 views

33 views

80 views

76 views

99 views

### Bell polynomial with variables 1 and 0

Let $B_{n,k}(x_1,\cdots,x_{n-k+1})$ be the Bell polynomial. If $x_1=\cdots=x_{n-k+1}=1$, we know that $B_{n,k}(x_1,\cdots,x_{n-k+1})=S(n,k)$, where $S(n,k)$ is the Stirling number of second kind. ...
Let $A$ be a finite, nonempty subset of an abelian group, and let $2A:=\{a+b\colon a,b\in A\}$ and $A-A:=\{a-b\colon a,b\in A\}$ denote the sumset and the difference set of $A$, respectively. If ...