Search arXivSearch

arXiv · 2512.19198

Parallelization of Welded Links

Abstract

The notion of a welded link was introduced by Fenn, Rimányi, and Rourke as an analogue of welded braids. A welded link is defined as an equivalence class of link diagrams that may contain virtual crossings, where the equivalence is generated by the classical and virtual Reidemeister moves together with the welded moves. In this paper, we introduce a parallelization construction for welded link diagrams and show that it is well defined: if two diagrams represent equivalent welded links, then the corresponding parallel diagrams obtained by our construction are also equivalent. When the two parallel strands are given parallel orientations, the resulting diagram admits a checkerboard coloring, whereas if they are assigned opposite orientations, the diagram is almost classical. Our construction further yields a decomposition in which one component is a copy of the original diagram and the other is a diagram representing a trivial welded link. We also investigate quandle colorings and the fundamental quandle of the parallel diagram, deriving a presentation from that of the original diagram. Finally, we examine conditions under which the parallel diagram is non-split.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Naoko Kamada, Seiichi Kamada. 2025-12-22. Parallelization of Welded Links. https://arxiv.org/abs/2512.19198

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