Search arXivSearch

arXiv · 2605.01976

A constructive solution to the equivalence problem for knot projectivizations

Abstract

The problem of whether different projectivizations of the same affine knot $K\subset\mathbb{S}^3$ are equivalent in $\mathbb{R}\mathbb{P}^3$ can be found in [11] and has also been posed as an open question in [15]. In this note we provide a constructive solution to the problem. In particular, we adapt an idea due to A. Hatcher developed in the realm of embedding spaces and we describe an algorithm that produces an explicit isotopy between any two given projectivizations of the same affine knot. More generally, we introduce the notion of lensification of a knot in any lens space $L(p,q)$ and describe an algorithm that works in that more general setting, of which $\mathbb{R}\mathbb{P}^3\simeq L(2,1)$ is a particular instance. Finally, we apply this algorithm to several pairs of knots from the literature for which the equivalence problem was raised as an open question, finding explicit isotopies.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergio de María, Javier Martínez-Aguinaga. 2026-05-03. A constructive solution to the equivalence problem for knot projectivizations. https://arxiv.org/abs/2605.01976

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

KEEP EXPLORING

Related papers

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

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

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