Computing the Rank of Braids
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...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
BYU ScholarsArchive
2021
|
| Subjects: | |
| Online Access: | https://scholarsarchive.byu.edu/etd/8947 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=9956&context=etd |