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 gr.group-theory
Search options not deleted
user 32951
Questions about the branch of algebra that deals with groups.
1
vote
Minimal size of subsets $A,B$ in a finite group $G$ such that $AB=G$
In general, one expects to need $N\log N$ "random" products to cover a set of size $N$, by coupon collecting analysis. So my intuition is that you need more than just $\sqrt N$ elements in the sets $A …
- 11