From 03cbe93ecc77d60ec13da20d8845136b72233558 Mon Sep 17 00:00:00 2001 From: Ulli Kehrle Date: Thu, 8 Nov 2018 12:06:53 +0100 Subject: README: added missing space --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'README.md') diff --git a/README.md b/README.md index 079997e..903e45a 100644 --- a/README.md +++ b/README.md @@ -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: -- cgit v1.2.3-24-g4f1b