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 finite-groups
Search options not deleted
user 40145
Questions on group theory which concern finite groups.
2
votes
Questions about a finite solvable group
This partial solution by Stuart Margolis:
The answer to question $2$ is definitely yes, the number of elements
required to generate $G$ can't be more than $D=2^{d-1}$. Suppose that $G$
requires more …
- 2,143
2
votes
1
answer
398
views
Questions about a finite solvable group
These questions are by Moshe Newman
Let $G$ be a finite solvable group of derived length $d$, with the
property that every proper subgroup and every proper quotient of $G$ has
derived length less th …
- 2,143
17
votes
1
answer
795
views
Are There Always Group Generators Which Give Unimodal Growth?
Suppose $G$ is a $k$-generated finite group. Is there always a set of $k$ elements which generate the group and have a unimodal counting function?
Background:
The counting function, $f(n)$, is a fun …
- 2,143