New Techniques for Computing Geometric Index
Kathryn B. Andrist, Dennis J. Garity, Du\v{s}an D. Repov\v{s}, and, David G. Wright

TL;DR
This paper presents new, unified techniques for computing the geometric index of links in solid tori, simplifying previous methods and enabling calculations for previously unknown cases.
Contribution
The paper introduces general techniques for computing the geometric index in solid tori, unifying and simplifying prior ad hoc methods and extending computability to new examples.
Findings
New techniques simplify geometric index calculations.
Method applies to complex links previously difficult to analyze.
Facilitates easy computation when solid torus is divided into chambers.
Abstract
We introduce \textcolor{red}{general} new techniques for computing the geometric index of a link in the interior of a solid torus . These techniques simplify and unify previous ad hoc methods used to compute the geometric index in specific examples \textcolor{red}{ and allow the simple computation of geometric index for new examples where the index was not previously known}. The geometric index measures the minimum number of times any meridional disc of must intersect . It is related to the algebraic index in the sense that adding up signed intersections of an interior simple closed curve in with a meridional disc gives the algebraic index of in . One key idea is introducing the notion of geometric index for solid chambers of the form in . After that we prove that if a solid torus can be divided into solid chambers by meridional discs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
