https://github.com/justinmeiners/braid-rank-thesis

https://github.com/justinmeiners/braid-rank-thesis

abstract-algebra algorithms braid-groups dynamic-programming math

Last synced: 23 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/justinmeiners/braid-rank-thesis
• Owner: justinmeiners
• Created: 2021-03-16T04:16:45.000Z (almost 4 years ago)
• Default Branch: master
• Last Pushed: 2022-06-24T02:26:23.000Z (over 2 years ago)
• Last Synced: 2024-10-29T20:02:29.576Z (2 months ago)
• Topics: abstract-algebra, algorithms, braid-groups, dynamic-programming, math
• Language: Common Lisp
• Homepage:
• Size: 20.6 MB
• Stars: 0
• Watchers: 3
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Computing the Rank of Braids

[Read the paper][3].

[View the slides summary][4]

(also available as a PDF in this repo.)

## Working with the Source Code

If you want to build the code you will

need to install [sbcl][1] and [quicklisp][2].

Once those are installed just run:

    ./install-deps.sh

This installs all the libraries and symlinks it in the quicklisp projects folder.

You can start an interactive session with

    ./run.sh

## Examples

Estimating the rank of a braid:

    (rank:upper-bound '(1 2 -1 3 4))

    (rank:lower-bound '(1 2 -1 3 4))

## Citing

    @mastersthesis{computing-braid-rank,

      author = {Justin Meiners}, 

      title = {Computing the Rank of Braids},

      school = {Brigham Young University},

      year = 2021,

      month = 4

    }

[1]: http://www.sbcl.org

[2]: https://www.quicklisp.org/beta/ 

[3]: https://github.com/justinmeiners/braid-rank-thesis/raw/master/paper/thesis.pdf

[4]: https://justinmeiners.github.io/braid-rank-thesis/