2000 character limit reached
The bridge number of surface links and kei colorings
Published 15 Apr 2020 in math.GT | (2004.07056v2)
Abstract: Meier and Zupan introduced bridge trisections of surface links in $S4$ as a 4-dimensional analogue to bridge decompositions of classical links, which gives a numerical invariant of surface links called the bridge number. We prove that there exist infinitely many surface knots with bridge number $n$ for any integer $n \geq 4$. To prove it, we use colorings of surface links by keis and give lower bounds for the bridge number of surface links.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.