diff options
| author | Ulli Kehrle <ulli.kehrle@rwth-aachen.de> | 2018-11-08 12:48:17 +0100 |
|---|---|---|
| committer | Ulli Kehrle <ulli.kehrle@rwth-aachen.de> | 2018-11-08 12:48:17 +0100 |
| commit | bfac88769e4788626e3166d7d6f4a3392ac9dbcc (patch) | |
| tree | f9d25ad1a6052fabf9d3eba5b53bac1db0c1fc98 | |
| parent | af197de3f2f5581ccfbd1810074dbddd2b3a86a0 (diff) | |
| download | subgroup-ladders-bfac88769e4788626e3166d7d6f4a3392ac9dbcc.tar.gz subgroup-ladders-bfac88769e4788626e3166d7d6f4a3392ac9dbcc.tar.xz | |
README: replace unicode S_n with ascii one.
| -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_0,...,H_k = Sₙ of the symmetric group S_nsuch that H_{i-1} is a subgroup of H_i 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_0,...,H_k = S_n of the symmetric group S_nsuch that H_{i-1} is a subgroup of H_i 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: |