Abstract

The image of a polygonal knot K under a spherical inversion of ℝ3 ∪ ∞ is a simple closed curve made of arcs of circles, perhaps some line segments, having the same knot type as the mirror image of K. But suppose we reconnect the vertices of the inverted polygon with straight lines, making a new polygon [Formula: see text]. This may be a different knot type. For example, a certain 7-segment figure-eight knot can be transformed to a figure-eight knot, a trefoil, or an unknot, by selecting different inverting spheres. Which knot types can be obtained from a given original polygon K under this process? We show that for large n, most n-segment knot types cannot be reached from one initial n-segment polygon, using a single inversion or even the whole Möbius group. The number of knot types is bounded by the number of complementary domains of a certain system of round 2-spheres in ℝ3. We show the number of domains is at most polynomial in the number of spheres, and the number of spheres is itself a polynomial function of the number of edges of the original polygon. In the analysis, we obtain an exact formula for the number of complementary domains of any collection of round 2-spheres in ℝ3. On the other hand, the number of knot types that can be represented by n-segment polygons is exponential in n. Our construction can be interpreted as a particular instance of building polygonal knots in non-Euclidean metrics. In particular, start with a list of n vertices in ℝ3 and connect them with arcs of circles instead of line segments: Which knots can be obtained? Our polygonal inversion construction is equivalent to picking one fixed point p ∈ ℝ3 and replacing each edge of K by an arc of the circle determined by p and the endpoints of the edge.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.