Advanced Combinatorics and Algebraic Number Theory Symbolic Computation library for JavaScript, Python
-
Updated
Dec 27, 2024 - JavaScript
Advanced Combinatorics and Algebraic Number Theory Symbolic Computation library for JavaScript, Python
Our implementation of the Smith Normal Form algorithm.
ANUBiS is a C++ library of high-performance algorithms for computing topological invariants of point sets and simplicial topological spaces.
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.
Some linear algebra work done in Haskell
Add a description, image, and links to the smith-normal-form topic page so that developers can more easily learn about it.
To associate your repository with the smith-normal-form topic, visit your repo's landing page and select "manage topics."