We describe a method for computing rank (and determining quasipositivity) in the free group using dynamic programming. The algorithm is adapted to computing upper bounds on the rank for braids. We test our method on a table of knots by identifying quasipositive knots and calculating the ribbon genus. We consider the possibility that rank is not theoretically computable and prove some partial results that would classify its computational complexity. We then present a method for effectively brute force searching band presentations of small rank and conjugate length.
| Identifer | oai:union.ndltd.org:BGMYU2/oai:scholarsarchive.byu.edu:etd-9956 |
| Date | 06 April 2021 |
| Creators | Meiners, Justin |
| Publisher | BYU ScholarsArchive |
| Source Sets | Brigham Young University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
| Rights | https://lib.byu.edu/about/copyright/ |
Page generated in 0.0139 seconds