Finding groups of a given order - or at least trying. Optimally before the universe ends.

Sebastian Kreisel 8e4ffa2bd8 Add: Minor changes and some experiments in main. Updated TODO 1 week ago
src 8e4ffa2bd8 Add: Minor changes and some experiments in main. Updated TODO 1 week ago
test faf49ba4dd Update: Major changes to all files to use elfc_lib. Many small improvements and fixes. 4 weeks ago
.gitignore faf49ba4dd Update: Major changes to all files to use elfc_lib. Many small improvements and fixes. 4 weeks ago
LICENSE fac149c34e yep 2 years ago
Makefile faf49ba4dd Update: Major changes to all files to use elfc_lib. Many small improvements and fixes. 4 weeks ago
README.txt e2d501db31 Remove: group_hom gen-based functions. Small additions to basic group functionality 3 weeks ago
TODO.txt 8e4ffa2bd8 Add: Minor changes and some experiments in main. Updated TODO 1 week ago

README.txt

Playing around with finite groups of low order (< 0xffff). Groups are
treated as black box object, i.e. are given by a multiplication table.


Main features (will) include:
* Generating "base"-groups: Cn, Sn, GL over finite fields, ...
* Basic property and subgroup analysis
* Computing minimal generating sets
* Checking for isomorphism
* Storing groups as multiplication table (plus additional information)
to files


Groups can be generated as subgroups of base groups such as Sn and GL over
finite fields. Groups may also be constructed with methods such as direct
products, commutators, ...


Stage 1 Properties (cheap)
* group order
* is cyclic
* is commutative
* element order distribution
* size of minimal generating set
* Stage 1 of center
* Stage 1 of commutator

Stage 2 Properties