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 |
Questions on group theory which concern finite groups.
50
votes
6
answers
10k
views
Generating finite simple groups with $2$ elements
Here is a very natural question:
Q: Is it always possible to generate a finite simple group with only $2$ elements?
In all the examples that I can think of the answer is yes.
If the answer is posit …
7
votes
0
answers
429
views
The maximal order of an element in orthogonal groups over finite fields of characteristic 2
Let $q$ be a power of $2$ and let $(V,Q)$ be a
quadratic space of dimension $2m$ over $\mathbb{F}_q$. Up to isometry, we know that we have exactly two classes of such quadratic spaces: the plus type a …
7
votes
2
answers
749
views
Looking for deterministic criteria to generate the symmetric group?
So let $S_N$ be the symmetric group of degree $N$. We think of it as a permutation group via its
natural action on the set $T=\{1,2,\ldots,N\}$.
Say that $H\leq S_N$ is a subgroup which acts transiti …
6
votes
3
answers
350
views
Bounding from below the cardinality of a set of generators of the $n$-fold cartesian product...
Let $G$ be a nontrivial finite group. Given $n\in\mathbb{Z}_{\geq 1}$,
let $G^n$ be the cartesian product of $n$ copies of $G$.
Further let $S\subseteq G^n$ be a generating set of $G^n$.
Question: Do …
5
votes
Looking for deterministic criteria to generate the symmetric group?
Well I think I have more or less an answer to my question. I have shown that the set
of all maximal imprimitive transitive subgroups $H\leq S_N$ is of the form
$$
S_{N/r}^{r}\rtimes S_r
$$
for $r|N$ …
5
votes
1
answer
2k
views
For what finite groups is the cardinality of a minimal generating set well defined?
Recently I learned that the cardinality of a minimal set of generators of a finite $p$-group
$G$ is well defined namely it is equal to the dimension of $H^1(G,\mathbb{F}_p)$. Moreover, if
$S:=\{g_1,\l …
3
votes
Generating a finite group from elements in each conjugacy class
The impossibility also follows from Jordan's lemma:
Let $G$ be a finite group which acts transitively on a set $\Omega$ with $|\Omega|:=n\geq 2$. Then there exists
a $g\in G$ such that $\chi(g)=0$ wh …