From 893abbaf05ddf0658d8648a3c6f6535708d2e0de Mon Sep 17 00:00:00 2001 From: Ulli Kehrle Date: Thu, 8 Nov 2018 12:26:01 +0100 Subject: Don't use unicode subscripts in README as some systems don't render it properly. This mostly reverts 407bc6af406de7286d377e5f2d1f848aaa84eb2e. --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index b4523ec..fed4217 100644 --- a/README.md +++ b/README.md @@ -4,12 +4,12 @@ This package provides an algorithm that computes a subgroup ladder from a permut 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. +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. Sometimes it is not possible to find such a series with small indices between consecutive subgroups. This is where subgroup ladders may make sense: -A subgroup ladder is series of subgroups G = H₀,…,Hₖ = Sₙ of the symmetric group such that for every 1≤i≤k, Hᵢ is a subgroup of Hᵢ₋₁ or Hᵢ₋₁ is a subgroup of Hᵢ. +A subgroup ladder is series of subgroups G = H_0,...,H_k = S_n of the symmetric group such that for every 1<=i<=k, H_i is a subgroup of H_{i-1} or H_{i-1} is a subgroup of H_i. So we sometimes go up to a larger group in order to keep the indices small. If G is a Young subgroup of S_n, the algorithm in this repository can find a subgroup ladder of G such that the indices are at most the degree of the permutation group. -- cgit v1.2.3-24-g4f1b From af197de3f2f5581ccfbd1810074dbddd2b3a86a0 Mon Sep 17 00:00:00 2001 From: Ulli Kehrle Date: Thu, 8 Nov 2018 12:46:35 +0100 Subject: Make documentation more verbose --- gap/subgroupladders.autodoc | 31 +++++++++++++++++++++++++++++++ gap/subgroupladders.gd | 5 ++--- 2 files changed, 33 insertions(+), 3 deletions(-) create mode 100644 gap/subgroupladders.autodoc diff --git a/gap/subgroupladders.autodoc b/gap/subgroupladders.autodoc new file mode 100644 index 0000000..0e9c8d2 --- /dev/null +++ b/gap/subgroupladders.autodoc @@ -0,0 +1,31 @@ +@AutoDocPlainText +@Chapter Introduction + +This package provides an algorithm that computes a subgroup ladder from a permutation group up to the parent symmetric group. +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_n of the symmetric group S_n such 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: +A subgroup ladder is series of subgroups G = H_0,...,H_k = S_n of the symmetric group such that for every 1 \leq i \leq k, H_i is a subgroup of H_{{i-1}} or H_{{i-1}} is a subgroup of H_i. +So we sometimes go up to a larger group in order to keep the indices small. + +If G is a Young subgroup of S_n, the algorithm in this repository can find a subgroup ladder of G such that the indices are at most the degree of the permutation group. + +@Chapter subgroupladders +@Section subgroupladders + +@Chapter License + +subgroupladders is free software you can redistribute it and/or modify it under +the terms of the GNU General Public License as published by the Free Software +Foundation; either version 3 of the License, or (at your option) any later +version. For details, see the file LICENSE distributed as part of this package +or see the FSF's own site. + +@Chapter References +[1] B. Schmalz. Verwendung von Untergruppenleitern zur Bestimmung von Doppelnebenklassen. Bayreuther Mathematische Schriften, 31, S.109--143, 1990. +@EndAutoDocPlainText diff --git a/gap/subgroupladders.gd b/gap/subgroupladders.gd index 59b9325..b663821 100644 --- a/gap/subgroupladders.gd +++ b/gap/subgroupladders.gd @@ -4,14 +4,12 @@ # Declarations # -#! @Chapter subgroup-ladders -#! @Section subgroup-ladders - #! @Description #! Given a list of lists part of positive integers, this will compute #! the Young subgroup corresponding to this partition. #! @Returns a group #! @Arguments part +#! @ChapterInfo subgroupladders, subgroupladders DeclareGlobalFunction( "YoungGroupFromPartition" ); #! @Description #! Given a permutation group G, this will compute a subgroup ladder @@ -26,4 +24,5 @@ DeclareGlobalFunction( "YoungGroupFromPartition" ); #! At this step, the index may be larger than the degree. #! @Returns a list of groups #! @Arguments G +#! @ChapterInfo subgroupladders, subgroupladders DeclareGlobalFunction( "SubgroupLadder"); -- cgit v1.2.3-24-g4f1b 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(-) 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 From 9470f7a21bde04823c8fa421be5de617ff551b2a Mon Sep 17 00:00:00 2001 From: Ulli Kehrle Date: Thu, 8 Nov 2018 12:57:50 +0100 Subject: doc: mention that YoungGroupFromPartition does not checker whether the input is valid. --- gap/subgroupladders.gd | 1 + 1 file changed, 1 insertion(+) diff --git a/gap/subgroupladders.gd b/gap/subgroupladders.gd index b663821..2291eb7 100644 --- a/gap/subgroupladders.gd +++ b/gap/subgroupladders.gd @@ -7,6 +7,7 @@ #! @Description #! Given a list of lists part of positive integers, this will compute #! the Young subgroup corresponding to this partition. +#! This function does not check whether the supplied lists are actually disjoint. #! @Returns a group #! @Arguments part #! @ChapterInfo subgroupladders, subgroupladders -- cgit v1.2.3-24-g4f1b From 12c5e8a03fe7db036a2e432079f162317c1c7c68 Mon Sep 17 00:00:00 2001 From: Ulli Kehrle Date: Thu, 8 Nov 2018 13:17:41 +0100 Subject: README: mention how to generate documentation --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index bfe9bec..d898268 100644 --- a/README.md +++ b/README.md @@ -47,6 +47,7 @@ install and use it, resp. where to find out more ## Documentation The documentation of this package is available as [HTML](https://hrnz.li/subgroupladders) and as a [PDF](https://hrnz.li/subgroupladders/manual.pdf). +It can also be generated locally with `gap makedoc.g`. ## Contact -- cgit v1.2.3-24-g4f1b