2000 character limit reached
Quadrisecant approximation of hexagonal trefoil knot
Published 14 Oct 2010 in math.GT | (1010.2926v1)
Abstract: It is known that every nontrivial knot has at least two quadrisecants. Given a knot, we mark each intersection point of each of its quadrisecants. Replacing each subarc between two nearby marked points with a straight line segment joining them, we obtain a polygonal closed curve which we will call the quadrisecant approximation of the given knot. We show that for any hexagonal trefoil knot, there are only three quadrisecants, and the resulting quadrisecant approximation has the same knot type.
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.