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 20709
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.
6
votes
Accepted
Questions on 'Improved bounds for the sunflower lemma'
Let me try to answer your questions.
We can recover the pair $(W, S_i)$ from the four quantities you mentioned. So the number of their combinations upper bounds the number of pairs $(W, S_{i})$, whic …
- 410
1
vote
Disjoint union of affine subspaces contains a larger affine subspace
Interesting question. One thing I would try is to look on a random linear decision tree of depth n-d, and then take any other leaf in your union. I am guessing that this would give negative results fo …
- 410
4
votes
1
answer
281
views
Approximate homomorphisms
Let $f:Z_2^n \to Z_p$ be a one-to-one map, where say $2^n<p<2^{n+1}$. What is the maximal probability that $\Pr[f(x+y)=f(x)+f(y)]$ where $x,y \in Z_2^n$ are uniform and independent? The identity map ( …
- 410