Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 85 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 37 tok/s
GPT-5 High 37 tok/s Pro
GPT-4o 100 tok/s
GPT OSS 120B 473 tok/s Pro
Kimi K2 240 tok/s Pro
2000 character limit reached

Khovanov homology of tangles: algorithm and computation (2508.14404v1)

Published 20 Aug 2025 in math.GT

Abstract: Knot, link, and tangle theory is crucial in both mathematical theory and practical application, including quantum physics, molecular biology, and structural chemistry. Unlike knots and links, tangles impose more relaxed constraints, allowing the presence of arcs, which makes them particularly valuable for broader applications. Although Khovanov homology for knots and links has been extensively studied, its computation for tangles remains largely unexplored. In our recent work, we provide a topological quantum field theory (TQFT) construction for the Khovanov homology of tangles, offering a more concrete method for its computation. The primary contribution of this work is a comprehensive approach to the computation of the Khovanov homology of tangles, offering both a detailed computation procedure and a practical guide for implementing algorithms through codes to facilitate the calculation. This contribution paves the way for further studies and applications of Khovanov homology in the context of tangles.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets