Ulli/subgroupladders
Ulli
/
subgroupladders
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
117 Commits 1 Branch 0 Tags 174 KiB
GAP 100%
Go to file
Ulli Kehrle 69989a97c7
reordered functions to match order in .gd file. 
Also stripped some trailing spaces.
 		2019-03-21 01:22:10 +01:00
doc Improved Documentation 2019-03-17 21:21:17 +01:00
gap reordered functions to match order in .gd file. 2019-03-21 01:22:10 +01:00
tst Add Test for optional parent group degree 2019-03-17 21:52:21 +01:00
.gitignore make this a gap package. 2018-11-08 11:58:26 +01:00
LICENSE make this a gap package. 2018-11-08 11:58:26 +01:00
PackageInfo.g updated repo URL in PackageInfo.g 2019-03-17 15:25:59 +01:00
README.md simplified README.md 2019-03-17 22:18:00 +01:00
init.g add (broken) tom support 2019-01-17 15:24:28 +01:00
makedoc.g modified documentation 2019-03-17 22:05:46 +01:00
read.g add (broken) tom support 2019-01-17 15:24:28 +01:00

README.md

The GAP package subgroupladders

This package provides an algorithm that computes a subgroup ladder from a permutation group up to the parent symmetric group. There is also a function included which computes portions of the table of marks using subgroup chains. The authors hope that this will someday be extended to use arbitrary subgroup ladders.

Documentation

The documentation of this package is available as HTML and as a PDF. It can also be generated locally with gap makedoc.g.

Contact

You can report issues on GitHub at https://github.com/ehwat/subgroupladders.

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.