diff options
| author | Ulli Kehrle <ulli.kehrle@rwth-aachen.de> | 2018-11-08 12:06:53 +0100 |
|---|---|---|
| committer | Ulli Kehrle <ulli.kehrle@rwth-aachen.de> | 2018-11-08 12:06:53 +0100 |
| commit | 03cbe93ecc77d60ec13da20d8845136b72233558 (patch) | |
| tree | f45e5598d0c3ace8c8b63c8ca99a6fb2b47091f5 /README.md | |
| parent | 407bc6af406de7286d377e5f2d1f848aaa84eb2e (diff) | |
| download | subgroup-ladders-03cbe93ecc77d60ec13da20d8845136b72233558.tar.gz subgroup-ladders-03cbe93ecc77d60ec13da20d8845136b72233558.tar.xz | |
README: added missing space
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -5,7 +5,7 @@ The algorithm was described by Bernd Schmalz in [1, Theorem 3.1.1]. Solutions of some problems in group theory can relatively easy be transferred to a sub- or supergroup if the index is small. Let G be a permutation group on the set {1,…,n}. -So one might try to find a series of subgroups G = H₀,…,Hₖ = Sₙ of the symmetric group Sₙsuch that Hᵢ₋₁ is a subgroup of Hᵢfor every i and transfer the solution of a problem for the symmetric group step by step to G. +So one might try to find a series of subgroups G = H₀,…,Hₖ = Sₙ of the symmetric group Sₙsuch that Hᵢ₋₁ is a subgroup of Hᵢ for every i and transfer the solution of a problem for the symmetric group step by step to G. Sometimes it is not possible to find such a series with small indices between consecutive subgroups. This is where subgroup ladders may make sense: |