The agda-unimath library
-
Updated
Jul 23, 2024 - Agda
The agda-unimath library
Amazing package to compute decompositions into irreducibles of explicit group representations and the Wedderburn decomposition for endomorphisms thereof!
Finite group study, abelians or not, quotient group, direct product and many more...
Bruteforce algorithm for creating all elements of a group presented by generators and relations.
♾ (prototype of) library for finite algebra
What C# can do for studying Finite Groups, quotient groups, semi-direct products, homomorphisms, automorphisms group, characters table, minimalistic rings and fields manipulations, polynomials factoring, fields extensions and many more...
Solvers for two group theory problems: find all homomorphisms Z/nZ to Z/mZ additive groups; find Z/nZ ring multiplicative group, factorize it by cyclic subgroup and print Cayley table for factor-group.
Bruteforce algorithm for creating all elements of a group presented by generators and relations.
I have compiled (hehe) some interesting code developed throughout my time in the degree I studied.
By using this program I achieved our research result and I give a talk at the 5th International Conference on Mathematical Advances and Applications in Istanbul, Turkey.
Small Groups study in Julia
Add a description, image, and links to the finite-groups topic page so that developers can more easily learn about it.
To associate your repository with the finite-groups topic, visit your repo's landing page and select "manage topics."