2000 character limit reached
Unknotting and Ascending Numbers of Knots and their Families
Published 10 Jul 2011 in math.GT | (1107.2110v1)
Abstract: Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at most 10 crossings, for which the unknotting number can be confirmed by using the general formulae for signatures. For 11 families of knots general formulae are obtained for their ascending numbers.
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.