2000 character limit reached
On the Categorified Wrapping Number Conjecture
Published 5 Jan 2025 in math.GT | (2501.02623v1)
Abstract: We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient to produce a nonzero homology class in $k$-grading $\mathrm{wrap}(L)$ on its own. This characterization primarily concerns the type of crossing resolutions abutting trivial circles.
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.