2000 character limit reached
$(4,-(2n+5))$-torus knot with only 1 normal ruling
Published 26 Dec 2015 in math.GT | (1512.08057v2)
Abstract: The main purpose of this paper is to provide an infinite family of counter examples of the open problem mentioned in [2]. In particular, we present an infinite family of a particular Legendrian $(4,-(2n+5))$-torus knot, for each $n \geq 0$, which has only 1 normal ruling, but do not satisfy the even number of clasps condition of Theorem 3 of [2]. Thus, these normal rulings cannot imply the existence of a decomposable exact Lagrandian filling.
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.