There are 2 repositories under algebraic-structures topic.
Examples and exercises from the blog series
Relational Algebra, now with more algebra!
A partial binary associative operator (appendMaybe :: a → a → Maybe a)
Спецификация для совместимости общих алгебраических структур в JavaScript
Algebraic structure implementations, do-notation, and operators to truly live the fantasy
Field-algebra based on Group / Ring symbolic vector module extension
💫 A library for working with ring-like algebraic structures that implements some common semirings
A simple, versatile engine to handle runtime customizable boolean logic
A library for hypercomplex algebras in Clojure
Small but neat OCaml library of (abstract) algebraic structures
Algebraic Proof System
Playing around with implementations of different algebraic structures in C++
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.
Groebner basis university project
Addition and multiplication on numbers are the prototypical example of an operation that combines two elements of a set to produce a third.
An exploration of fumulas in Agda—a new perspective on ring theory
A library of mathematical structures based on type classes proposed in Haskell
Code accompanying the paper: "Reduced submodules of finite dimensional polynomial modules"
Algebraic algorithm to find a shortest cycle of even length in a directed graph
Computational Algebra algorithms implemented using Maple.
In hopes of trying to make it faster, it's a cpp port of: https://github.com/MihaiMocanuGit/AssociativeOperationsCounter
I have compiled (hehe) some interesting code developed throughout my time in the degree I studied.
Field algebra constant parametric type
intro to crypto given to my coworkers at AIS
Documents presenting the fundamentals of additively partial algebra
Introduction to the fundamental techniques of algorithm analysis. Also, Boolean logic, combinatorics, functions, graphs, algebraic structures, recursion, recurrence relations, finite state machines, and computability.
Subclass of the built-in function type for representing algebraic operators (that are typically associated with algebraic structures and algebraic circuits) as immutable, hashable, sortable, and callable objects.