Computational Group Theory in Scala. It's Scala permuted!

AIDN is a deep learning algorithm to represent any finitely-presented algebraic object with a set of deep neural networks.

Automatical Generator of Conformal Bootstrap Equation

A scheme to implement finite groups as oblivious data structures. The oblivious operations are defined by a set of secure multiparty computation (MPC) protocols. Practical protocols are presented for the group of quadratic residues, elliptic curves groups and class groups of imaginary quadratic orders.

Basic group theory algorithms for permutation groups, such as the creation of a stabilizer chain.

Implementation of Isoperimetric and Isodiametric Functions of Groups in Haskell

My solutions to Google's Foobar challenge.

Program to perform operations with finite groups

FGroupPy is a software tool that allows you to perform various operations and analyses on mathematical groups. It provides a Python class called Group that represents a group and offers a set of methods to work with groups, including checking group properties, finding subgroups, generating multiplication tables, identifying normal subgroups, etc.

Writing for my senior thesis

GAP package to compute canonical conjugate respresentatives in nilpotent groups

Dirty and raw repo for working polychromatic rotations of images using PixelsGT.jl project

GAP functions for finitely generated nilpotent groups

Run a Markov chain on a Cayley Graph to simulate different card shuffling techniques

Functions to calculate the breadth of a nilpotent Lie algebra