smith-normal-form

A self-contained python library designed to apply Mathematical Surgery Theory over Manifolds.

Our implementation of the Smith Normal Form algorithm.

Topological Data Analysis using cubical homology. Implements algorithms from Tomasz Kaczynski's Computational Homology. Utilizes the open-source exact linear algebra library LinBox for Smith normal form computations. Uses these TDA methods to compute the cubical homology of grids obtained from cellular automata.

ANUBiS is a C++ library of high-performance algorithms for computing topological invariants of point sets and simplicial topological spaces.

Category-theoretic graph structures in Rust — strict Fong & Spivak hypergraph categories (cospans, props, Frobenius), with applied, magnitude, physics, and DL extensions, plus a term-language frontend (print/parse/eval/typed builder)

Toolkit for verifiable adversarial data tasks for AI agents: exact integer linear algebra and modular arithmetic with re-checkable certificates, a CLI and a Docker demo

Algorithms to compute Smith and Hermite Normal Forms over different Euclidean Domains

Unrefereed candidate: exact Smith invariants and affine determinant lines for binary-form factorisation maps.

The whole 2-part of the sandpile group (critical group) of the hypercube Q_n, for every n, open since Bai (2003): an explicit rule through tilting modules of SL_2 in characteristic 2, the fold law for the folded cube, and proofs of conjectures of Gao, Marx-Kuo, McDonald and Yuen. Paper, checks and the full record of verification.

Some linear algebra work done in Haskell