Skip to main content
MathOverflow

Return to Question

edited formatting (mostly)
Source Link
Marco Golla
Marco Golla
  • 10.9k
  • 3
  • 41
  • 63

What is the rank (minimal number of group generators) of SL(n,F)$SL(n,\mathbb{F})$ in the situation when SL(n,F)$SL(n,\mathbb{F})$ is not perfect (when SL(n,F)i.e. when $SL(n,\mathbb{F})$ is different from SL(2,2)$SL(2,\mathbb{F}_2)$ and SL(2,3)$SL(2,\mathbb{F}_3)$)? If the general formula is not known, are there n$n$ and F$F$ which make rank(SL(n,F))>k$rank(SL(n,\mathbb{F}))>k$ for a fixed k $k$ (or at least for k=2$k=2$).?

What is the rank (minimal number of group generators) of SL(n,F) in the situation when SL(n,F) is not perfect (when SL(n,F) is different from SL(2,2) and SL(2,3))? If the general formula is not known, are there n and F which make rank(SL(n,F))>k for a fixed k (or at least for k=2).

What is the rank (minimal number of group generators) of $SL(n,\mathbb{F})$ in the situation when $SL(n,\mathbb{F})$ is not perfect (i.e. when $SL(n,\mathbb{F})$ is different from $SL(2,\mathbb{F}_2)$ and $SL(2,\mathbb{F}_3)$)? If the general formula is not known, are there $n$ and $F$ which make $rank(SL(n,\mathbb{F}))>k$ for a fixed $k$ (or at least for $k=2$)?

Source Link
Sergei Matrosov
Sergei Matrosov
  • 29
  • 1

Rank of a special linear group over a finite field

What is the rank (minimal number of group generators) of SL(n,F) in the situation when SL(n,F) is not perfect (when SL(n,F) is different from SL(2,2) and SL(2,3))? If the general formula is not known, are there n and F which make rank(SL(n,F))>k for a fixed k (or at least for k=2).