Videos

Computational bounds on the band rank

Presenter
April 25, 2022
Abstract
The band rank of a braid is the length of its shortest decomposition into a product of conjugates of Artin generators. Using braided surfaces the band rank of a braid can be used to express the ribbon genus of its closure, and thus it is very difficult to compute in general. In this talk I will outline computational approaches to producing upper and lower bounds on the band rank of a braid. This is joint work with Justin Meiners.