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 531117
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
1
answer
164
views
Maximal zero-sum free sequences of $C_3^n$
I am working on the Davenport constant for groups, $D(G)$, which is the minimal number $d$ such that every sequence or multiset of $d$ elements of the group $G$ always contains some non-empty zero-sum …
3
votes
0
answers
152
views
Correspondence between even and odd permutations in $S_5$
I am working on the Davenport constant for symmetric groups, $D(G)$
, which is the minimal number $d$
such that every sequence of $d$
elements in the group G
is one-product sequence, i.e, we can alway …
3
votes
1
answer
252
views
Davenport constant $D(S_5)=10$ or $11$?
I am working on computing the Davenport constant $D(G)$
of symmetric groups, which is the minimal number $d$
such that every sequence of $d$
elements, possibly with repetitions, is one-product, i.e. t …
2
votes
1
answer
223
views
Is the small Davenport constant for $S_n$, $d(S_n)=n(n-1)/2$?
The Davenport constant $D(G)$ of a finite group $G$ is the minimal $d$ such that any sequence/multiset of length $d$ is one-product, i.e., identity can be obtained as a product (in some order) of some …
0
votes
0
answers
159
views
One-product free sequences for $A_n$
I am working on computing the Davenport constant $D(G)$ for $S_n$ and $A_n$, i.e., the minimal number $d$ such that every sequence (multiset) of $d$ elements contains some subsequence giving identity …