Search arXivSearch

arXiv · 2101.03538

Pseudo links and singular links in the Solid Torus

Abstract

In this paper we introduce and study the theories of pseudo links and singular links in the Solid Torus, ST. Pseudo links are links with some missing crossing information that naturally generalize the notion of knot diagrams, and that have potential use in molecular biology, while singular links are links that contain a finite number of self-intersections. We consider pseudo links and singular links in ST and we set up the appropriate topological theory in order to construct invariants for these types of links in ST. In particular, we formulate and prove the analogue of the Alexander theorem for pseudo links and for singular links in ST. We then introduce the mixed pseudo braid monoid and the mixed singular braid monoid, with the use of which, we formulate and prove the analogue of the Markov theorem for pseudo links and for singular links in ST. \smallbreak Moreover, we introduce the pseudo Hecke algebra of type A, $P\mathcal{H}_n$, the cyclotomic and generalized pseudo Hecke algebras of type B, $P\mathcal{H}_{1, n}$, and discuss how the pseudo braid monoid (cor. the mixed pseudo braid monoid) can be represented by $P\mathcal{H}_{n}$ (cor. by $P\mathcal{H}_{1, n}$). This is the first step toward the construction of HOMFLYPT-type invariants for pseudo links in $S^3$ and in ST. We also introduce the cyclotomic and generalized singular Hecke algebras of type B, $S\mathcal{H}_{1, n}$, and we present two sets that we conjecture that they form linear bases for $S\mathcal{H}_{1, n}$. Finally, we generalize the bracket polynomial for pseudo links in ST.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ioannis Diamantis. 2022-12-11. Pseudo links and singular links in the Solid Torus. https://doi.org/10.46298/cm.10438

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