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 46140
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.
3
votes
Accepted
Acyclic matching property in $\mathbb{Z}/p\mathbb{Z}$
Using a similar approach to LeechLattice's extended comment, consider $A = G \setminus \{0, 1, 3\}$, $B_1 = G \setminus \{0, 1, 2\}$, $B_5 = G \setminus \{0, 1, 6\}$. Over general (i.e. not necessaril …
- 7,226
3
votes
Accepted
Davenport constant $D(S_5)=10$ or $11$?
In a comment, Brendan McKay suggested searching for quintuples which are one-free and inverse-free. There are no such quintuples, but there are quadruples, and by repeating elements from one such I pr …
- 7,226
1
vote
Accepted
Only trivial solution to a pair of constrained linear diophantine equations
The answer to the first question is negative.
Let $A$ denote the set of weights $\{a_i\}$. Strengthen the first constraint to $0 \le x_i \le 2$.
If we have two different subsets $S_1, S_2 \subset A$ o …
- 7,226