Skip to content

justinmeiners/braid-rank-thesis

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

73 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Computing the Rank of Braids

Read the paper. View the slides summary (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 and quicklisp. 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
}