The agda-unimath library

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...

A computer algebra system in Smalltalk

Amazing package to compute decompositions into irreducibles of explicit group representations and the Wedderburn decomposition for endomorphisms thereof!

♾ (prototype of) library for finite algebra

Finite group study, abelians or not, quotient group, direct product and many more...

Small Groups study in Julia

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.

Bruteforce algorithm for creating all elements of a group presented by generators and relations.

Bruteforce algorithm for creating all elements of a group presented by generators and relations.

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.

I have compiled (hehe) some interesting code developed throughout my time in the degree I studied.

A Mathematica package developed for mathematical physics research involving Hopf algebras, representation theory, and fusion categories. This package was originally developped to support my research direction in R-parastatistics [Nature 637, 314-318 (2025)], but can also be used more broadly for studying topological order and generalized symmetry.