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 89000
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
0
answers
73
views
Number of classes $\pmod p$ represented by $b_1s^{n-1} + \dots + b_n$ where $ord_p(s) = n$
Let $n \in \mathbb Z$ with $n \ge 3$ and let $p$ be a prime number such that $n|p-1$. Let $a_1,a_2,\dots,a_{2n-1} \in \mathbb Z/p\mathbb Z$. Suppose that the same class is represented by at most $n-1$ …
- 169
1
vote
1
answer
115
views
Invariant complementary sets modulo $p$
Let $p \ge 11$ be a prime number, $k,n$ be positive integers such that $n|gcd(p-1,k-1)$ and $p > k > n \ge 5$. Let $s \in \mathbb Z_p$ such that $ord_p(s) = n$. Is it possible that the sets $A = \{1,2 …
- 169
0
votes
1
answer
448
views
Geometric progression modulo p [closed]
Let $p\ge 11$ be a prime number, $n \ge 5$ be an odd positive divisor of $p-1$ and $s \in \mathbb Z_p$ such that $ord_p(s) = n$.
Is it true that the geometric progression $\{s^k\}_{k \in \mathbb Z_n} …
- 169