Papers
Topics
Authors
Recent
Search
2000 character limit reached

Efficient Detection of Borromean Linking in Ellipses

Published 18 Sep 2025 in math.GT | (2509.15104v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 4 likes about this paper.

Sign Up for Free

alphaXiv

  1. Efficient Detection of Borromean Linking in Ellipses (7 likes, 0 questions)