arXiv · 2509.15104
Efficient Detection of Borromean Linking in Ellipses
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jonathan Strange, Ryan Blair, Alexander R. Klotz. 2025-09-18. Efficient Detection of Borromean Linking in Ellipses. https://arxiv.org/abs/2509.15104
Cite the original work for its findings. Save a collection to share your selection of sources.