Parallelization of Welded Links
Naoko Kamada, Seiichi Kamada

TL;DR
This paper introduces a parallelization method for welded link diagrams, demonstrating its well-defined nature, effects on diagram properties, and implications for quandle colorings and link decomposition.
Contribution
It presents a novel parallelization construction for welded links, analyzing its properties and effects on link invariants and structure.
Findings
Parallelization preserves welded link equivalence.
Parallel diagrams can be almost classical or admit checkerboard coloring.
Conditions for non-split parallel diagrams are identified.
Abstract
The notion of a welded link was introduced by Fenn, Rim\'anyi, 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · Computational Geometry and Mesh Generation
