Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with additive-combinatorics
Search options not deleted
user 74918
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.
2
votes
0
answers
59
views
Does periodic pattern arise in syndetic pattern
We wonder for two "large" sets $I,J\subseteq \omega$, if $(J-J)\cap I=\emptyset$, then it must be due to certain periodic pattern.
We say $I\subseteq \omega$ is $t$-syndetic iff for every $n\in\omega$ …
- 909
2
votes
1
answer
288
views
Is the consecutive sum set large in general?
$\DeclareMathOperator\CSS{CSS}$It is well known that for a set $A$ of integers, if $\gcd(A) = d$,
then the set of (integer) linear combinations of $A$ is $d\mathbb{Z}$.
I'm looking for a probability g …
- 909
0
votes
1
answer
150
views
Finite Hindman theorem
Consider the following finite version Hindman theorem:
For every sufficiently large $N\in\omega$ and 2-partition of $N=N_0\cup N_1$, there are $i<2,a,b,c\in N_i$ such that $a+b=c$.
The only proof I kn …
- 909