From bfac88769e4788626e3166d7d6f4a3392ac9dbcc Mon Sep 17 00:00:00 2001 From: Ulli Kehrle Date: Thu, 8 Nov 2018 12:48:17 +0100 Subject: README: replace unicode S_n with ascii one. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'README.md') diff --git a/README.md b/README.md index fed4217..bfe9bec 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_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: -- cgit v1.2.3-24-g4f1b