Search arXivSearch

arXiv · 1709.10332

Knot polynomials from 1-cocycles

Abstract

Let $M_n$ be the topological moduli space of all parallel n-cables of long framed oriented knots in 3-space. We construct in a combinatorial way for each natural number $n>1$ a 1-cocycle $R_n$ which represents a non trivial class in $H^1(M_n; \mathbb{Z} [x_1,x_2,...,x_1^{-1},x_2^{-1},...])$, where the number of variables $x_m$ depends on $n$. To each generic point in $M_n$ we associate in a canonical way an arc {\em scan} in $M_n$, such that $R_n(scan)$ is already a polynomial knot invariant. We show that $R_3(scan)$ detects the non-invertibility of the knot $8_{17}$ in a very simple way and without using the knot group. There are two well-known canonical loops in $M_n$ for each parallel n-cable of a long framed knot $K$: Gramain's loop {\em rot} and the Fox-Hatcher loop {\em fh}. The calculation of $R_n$ is of at most quartic complexity for these loops with respect to the number of crossings of $K$ for each fixed $n$. It follows from results of Hatcher that $K$ is not a torus knot if the rational function $R_n(fh(K))/R_n(rot(K))$ is not constant for each $n>1$. $ \oplus_n R_n$ is a natural candidate in order to separate all classes in $H_1(M_1;\mathbb{Q}) \cong H_1(M_n;\mathbb{Q})$, and in particular to distinguish all knot types $π_0(M_1)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Fiedler. 2019-01-16. Knot polynomials from 1-cocycles. https://arxiv.org/abs/1709.10332

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