A Simplification of Combinatorial Link Floer Homology
Anna Beliakova
TL;DR
This paper introduces a simplified combinatorial complex for computing the hat version of link Floer homology over Z/2Z, making calculations more efficient by reducing complexity.
Contribution
It presents a new, smaller combinatorial complex for link Floer homology, improving computational efficiency over previous models.
Findings
The new complex is significantly smaller than existing ones.
It accurately computes the hat version of link Floer homology.
The approach simplifies calculations in knot theory.
Abstract
We define a new combinatorial complex computing the hat version of link Floer homology over Z/2Z, which turns out to be significantly smaller than the Manolescu-Ozsvath-Sarkar one.
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.
Taxonomy
TopicsGeometric and Algebraic Topology · Topological and Geometric Data Analysis · Advanced Combinatorial Mathematics