Search arXivSearch

arXiv · 2504.18836

The crossing and the arc from the topological viewpoint

Abstract

The combinatorial approach to knot theory treats knots as diagrams modulo Reidemeister moves. Many constructions of knot invariants (e.g., index polynomials, quandle colorings, etc.) use elements of diagrams such as arcs and crossings by assigning invariant labels to them. The universal invariant labels, which carry the most information, can be thought of as equivalence classes of arcs and crossings modulo the relation, which identifies corresponding elements of diagrams connected by a Reidemeister move. We can call these equivalence classes the arcs and crossings of the knot. In the paper, we give a topological description of sets of these classes as the isotopy classes of probes of diagram elements. In the second part of the paper, we discuss the homotopy classes of diagram elements. We demonstrate that the sets of these classes are fundamental for the algebraic objects that are responsible for coloring diagrams of tangles on a given surface. For arcs, these algebraic objects are quandles; for regions, they are partial ternary quasigroups; for semiarcs, they are biquandloids; and for crossings, they are crossoids. The definitions of the last three algebraic structures are given in the paper. Additionally, we introduce the multicrossing complex of a tangle and define the crossing homology class. In a sense, the multicrossing complex unifies tribracket, biquandle and crossoid homologies; and the tribracket, biquandle and crossoid cycle invariants are actually the result of pairing a tribracket (biquangle, crossoid) cocycle with the crossing homology class.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Igor Nikonov. 2025-04-26. The crossing and the arc from the topological viewpoint. https://arxiv.org/abs/2504.18836

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