Category:Theorems in group theory
 | Computing portal |
Here is a list of articles in the category Theorems in group theory of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Theorems in group theory"
The following 67 pages are in this category, out of 67 total.
A
- Adian–Rabin theorem (computing)
- Alperin–Brauer–Gorenstein theorem (computing)
B
- B-theorem (computing)
- Baer–Suzuki theorem (computing)
- Balance theorem (computing)
- Brauer–Fowler theorem (computing)
- Brauer–Suzuki theorem (computing)
- Brauer–Suzuki–Wall theorem (computing)
- Burnside theorem (computing)
- Burnside's lemma (computing)
- Burnside's theorem (computing)
C
- Cartan–Dieudonné theorem (computing)
- Cauchy's theorem (group theory) (computing)
- Cayley's theorem (computing)
- Classical involution theorem (computing)
- Component theorem (computing)
F
- Feit–Thompson theorem (computing)
- Fitting's theorem (computing)
- Focal subgroup theorem (computing)
- Frattini's argument (computing)
- Frobenius determinant theorem (computing)
- Frobenius's theorem (group theory) (computing)
- Fundamental theorem of Galois theory (computing)
G
- Gilman–Griess theorem (computing)
- Golod–Shafarevich theorem (computing)
- Gorenstein–Harada theorem (computing)
- Gorenstein–Walter theorem (computing)
- Gromov's theorem on groups of polynomial growth (computing)
- Grushko theorem (computing)
H
- Hahn embedding theorem (computing)
- Hajós's theorem (computing)
- Hall–Higman theorem (computing)
- Higman's embedding theorem (computing)
- Higman–Sims asymptotic formula (computing)
- Hurwitz's automorphisms theorem (computing)
J
- Jordan's theorem (symmetric group) (computing)
- Jordan–Schur theorem (computing)
K
- Krull–Schmidt theorem (computing)
- Kurosh subgroup theorem (computing)
L
- L-balance theorem (computing)
- Lagrange's theorem (group theory) (computing)
M
- Maschke's theorem (computing)
- Matsumoto's theorem (group theory) (computing)
N
- Nagao's theorem (computing)
P
- Peter–Weyl theorem (computing)
- Ping-pong lemma (computing)
- Prüfer theorems (computing)
R
- Replacement theorem (computing)
- Ribet's lemma (computing)
S
- Schreier conjecture (computing)
- Schreier refinement theorem (computing)
- Schreier's lemma (computing)
- Schur–Zassenhaus theorem (computing)
- Scott core theorem (computing)
- Sims conjecture (computing)
- Stallings theorem about ends of groups (computing)
- Subgroup test (computing)
T
- Thompson transitivity theorem (computing)
- Thompson uniqueness theorem (computing)
- Three subgroups lemma (computing)
- Tits alternative (computing)
- Trichotomy theorem (computing)
U
- Universal embedding theorem (computing)
W
- Walter theorem (computing)
Z
- Z* theorem (computing)
- Zassenhaus lemma (computing)
- ZJ theorem (computing)
Mathematics
Organizations
Books
About