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

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

A computer algebra system in Smalltalk

The Feit–Thompson odd order theorem in Lean 4, with the finite group theory library it required — Hall, Fitting, Frobenius groups, transfer, ZJ, Dade isometry, coherence

♾ (prototype of) library for finite algebra

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

Self-contained lean-eval submission of the Feit–Thompson theorem, extracted from yawara/odd-order

Small Groups study in Julia

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

Data and code for the triple product property (TPP) triples computational search project

A Python CLI tool for visualizing Cayley graphs of finite groups. Supports cyclic, dihedral, symmetric, alternating, and custom groups with automated generator detection.

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.

RIME: spectral, transport, accessibility, and observable-pipeline geometry for finite represented systems, with Rubik as a reproducible laboratory.

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.

Explicit constructions of representations of finite general linear groups in SageMath, Python.

An automated GAP script to compute and analyze the finite convergence of the automorphism tower problem for various groups, developed for the "Laboratorio di Matematica Computazionale" exam.

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

A complete solution of Kourovka Notebook Problem 21.87 with supporting research materials

Lie-type classification and reproducible GAP certificates for Kourovka Notebook Problems 19.57 and 19.58