Skip to main content
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
Search options not deleted user 37555

Questions on group theory which concern finite groups.

10 votes
Accepted

On the Upper Density of $C_2$ in finite groups

Pyber showed that the number of groups of order $n$ is $\leq n^{\frac{2}{27}\nu(n)^3+C\nu(n)^{3/2}}$, where $\nu$ is the highest power of a prime dividing $n$ and $C$ is an absolute constant. On the o …
Jan-Christoph Schlage-Puchta's user avatar
12 votes
1 answer
1k views

How many generators does a direct product of alternating groups need?

P. Hall gave a formula for the number of generators of $G^n$ for any finite simple group $G$. One famous example is the fact that $A_5^{19}$ is 2-generated, but $A_5^{20}$ is not. The question of comp …
Jan-Christoph Schlage-Puchta's user avatar
2 votes
Accepted

A good upper-bound for the cardinal of an interval of finite groups

A chain in $[H,G]$ has length $\leq\Omega(|G:H|)$, where $\Omega$ denotes the number of prime factors counted with multiplicity. If $H=H_0<H_1<\dots<H_k=G$ is a maximal chain, then there are elements …
Jan-Christoph Schlage-Puchta's user avatar
8 votes

Simplicity of alternating group $A_n$

I prefer the proof going via 3-cycles. It is probably the least elegant proof, but it is the one which you probably would have found when considering the problem without any prior knowledge. Also the …
Jan-Christoph Schlage-Puchta's user avatar
12 votes
1 answer
503 views

Can a large transitive permutation group need many generators?

let $G$ be a transitive permutation group acting on $\{1, \ldots, n\}$, and let $d(G)$ be the minimal number of generators of $G$. Is it true, that for $n\rightarrow\infty$ we have $\frac{d(G)\log|G|} …
Jan-Christoph Schlage-Puchta's user avatar
10 votes
Accepted

Generalizing the Notion of Nilpotent/Abelian/Cyclic Numbers

A nilpotent group is the direct product of its Sylow subgroups, hence the nilpotency class of a nilpotent group equals the maximum of the nilpotency classes of its Sylow subgroups. A group of order $p …
Jan-Christoph Schlage-Puchta's user avatar