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 527577
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.
5
votes
0
answers
536
views
A problem on additive combinatorics in right-ordered groups
In a paper Small doubling in ordered groups: generators and structure it is proven in Lemma 4 page no. 598 that:
Let $G$ be an ordered group. Let $S$ be a finite subset of $G$ with at least two eleme …
1
vote
0
answers
37
views
Lower bound for restricted sumset in ordered groups
Recently in The restricted sumsets in finite abelian groups it is proved that
Suppose that $k \geq 2$ and $A$ is a non-empty subset of a finite abelian
group $G$ with $|G| > 1$. Then the cardinality …
