Search arXivSearch

arXiv · 2307.09387

Characterization and Further Applications of the Bar-Natan Zh-Construction

Abstract

Bar-Natan's Zh-construction associates to each $n$ component virtual link diagram $L$ an $(n+1)$ component virtual link diagram $Zh(L)$. If $L_0,L_1$ are equivalent virtual link diagrams, then $Zh(L_0),Zh(L_1)$ are equivalent as semi-welded links. The importance of the $Zh$-construction is that it unifies several classical knot invariants with virtual knot invariants. For example, the generalized Alexander polynomial of a virtual link diagram $L$ is identical to the usual multi-variable Alexander polynomial of $Zh(L)$. From this it follows that the generalized Alexander polynomial is a slice obstruction: it vanishes on any knot concordant to an almost classical knot. Our main result is a characterization theorem for the $Zh$-construction in terms of almost classical links. Several consequences of this characterization are explored. First, we give a purely geometric description of the $Zh$-construction. Secondly, the $Zh$-construction is used to obtain a simple derivation of the Dye-Kauffman-Miyazawa polynomial. Lastly, we show that every quandle coloring invariant and quandle 2-cocycle coloring invariant can be extended to a new invariant using the $Zh$-construction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Micah Chrisman, Robert G. Todd. 2023-07-21. Characterization and Further Applications of the Bar-Natan Zh-Construction. https://arxiv.org/abs/2307.09387

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