2000 character limit reached
Efficient Detection of Borromean Linking in Ellipses (2509.15104v1)
Published 18 Sep 2025 in math.GT
Abstract: We describe a method by which the number of intersections one ellipse makes inside the plane of another can be determined. The method is based on applying a transformation that reverts one ellipse to the unit circle, and examining the intersection points of the transformed second ellipse with the unit circle. This may be used to efficiently determine Hopf linking between two ellipses, or Borromean linking between three ellipses.
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.