2000 character limit reached
Splitting links by integer homology spheres
Published 29 Feb 2024 in math.GT | (2403.00064v2)
Abstract: For every $n \ge 3$, we construct 2-component links in $S{n+1}$ that are a split by an integer homology $n$-sphere, but not by $Sn$. In the special case $n=3$, i.e. that of 2-links in $S4$, we produce an infinite family of links $L_\ell$ and of integer homology spheres $Y_\ell$ such that the link $L_\ell$ is (topologically or smoothly) split by $Y_\ell$ and by no other integer homology sphere in the family.
Sponsor
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.