Computes free splittings of graph braid groups.
-
Updated
Mar 6, 2024 - Python
Computes free splittings of graph braid groups.
Search for non-trivial elements of the kernel of the Burau representation of the four-strand braid group.
Computes presentations of graph braid groups.
The primary objective of this study is to explore the application of Grover’s Algorithm to structured problems inspired by braid groups. Given a target tangle (a known permutation of 3 strands), the quantum circuit finds the exact braid word (sequence of 3 crossing moves) that produced it — without being told what the word is.
Code & data for "A dichotomous Leggett–Garg witness for braid-representation density in SU(2)_k."
Library for the calculation and understanding of the Alexander Data, a proposed invariant for textiles. (MSc Data Science & AI Dissertation)
My master's thesis in low-dimensional topology
Experimental cryptographic hash/XOF research project combining finite-field arithmetic, Feistel rounds, a sponge construction, and Garside braid normalization. Includes a C reference implementation, reproducible tests, and cryptanalysis reports. Not for production use.
To associate your repository with the braid-groups topic, visit your repo's landing page and select "manage topics."