Dealing with generators
Closed this issue · 1 comments
With basics abelians groups or direct products, computing all automorphisms or all homomorphism is possibles from canonics generetors, but it can takes very long time. Generators for abelians subgroups is more complicated, they are not canonics but it is possible.
Dealing with generators will also resolve complex cases of semidirect product. Finding generators quickly for non abelian groups, when they are isomorphic to a semidirect product, it can be probably done, may be a tiny classifier of groups by order is necessary.
Computing finitely presented group by generators and relators with bruteforce is very costly, they can be included in this project but not at this time.
The project uses implicitly many well known theorems and they can be explained in details inside the "future" documentation.
Generators allows also to compute all subgroups, and will be the possible last step to finish dealing with Groups Morphisms, then classic groups will be fast to write, to complete the first objective of this project, and staying accessible for undergraduate level.