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 35673
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.
1
vote
A (Hard?) combinatorial optimization problem involving the representation numbers
The trivial upper bound is in some sense best possible. Suppose I choose both partitions to consist of $p/N$ intervals of length $N$, say $[1,N],[N+1,2N],[(p-1)/N,p]$ (with a small error). Now given a …
- 133
1
vote
When does a Bohr set have the right size?
To some extent one can obtain upper bounds on $B(\Gamma,\epsilon)$ when $\Gamma$ is quite special. For instance, when $\Gamma$ is dissociated (which is to say, the sums $\sum_{s\in S}s$ are distinct f …
- 133
3
votes
1
answer
376
views
When does a Bohr set have the right size?
Fix a set $
\Gamma\subset \mathbb F_p$, the field with $p$ elements and a parameter $\epsilon>0$. The Bohr set $B(\Gamma,\epsilon)$ consists of those $x$ for which $x\cdot \Gamma\subseteq[-\epsilon p, …
- 133