Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2309.12297

Satellite knots and immersed Heegaard Floer homology

Wenzhao Chen·Jonathan Hanselman
View original source ↗Read source document ↗Export metadata ↓

Abstract

We describe a new method for computing the $UV = 0$ knot Floer complex of a satellite knot given the $UV = 0$ knot Floer complex for the companion and a doubly pointed bordered Heegaard diagram for the pattern, showing that the complex for the satellite can be computed from an immersed doubly pointed Heegaard diagram obtained from the Heegaard diagram for the pattern by overlaying the immersed curve representing the complex for the companion. This method streamlines the usual bordered Floer method of tensoring with a bimodule associated to the pattern by giving an immersed curve interpretation of that pairing, and computing the module from the immersed diagram is often easier than computing the relevant bordered bimodule. In particular, for (1,1) patterns the resulting immersed diagram is genus one, and thus the computation is combinatorial. For (1,1) patterns this generalizes previous work of the first author which showed that such immersed Heegaard diagram computes the $V=0$ knot Floer complex of the satellite. As a key technical step, which is of independent interest, we extend the construction of a bigraded complex from a doubly pointed Heegaard diagram and of an extended type D structure from a torus-boundary bordered Heegaard diagram to allow Heegaard diagrams containing an immersed alpha curve.

Explore related subjects

math.GTmath.SG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenzhao Chen, Jonathan Hanselman. 2023-09-21. Satellite knots and immersed Heegaard Floer homology. https://doi.org/10.2140/gt.2026.30.1719

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT↗
arXiv2026

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT↗
arXiv2026

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT↗