Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2507.15086

Topology and Algebra of Bonded Knots and Braids

Ioannis Diamantis·Louis H. Kauffman·Sofia Lambropoulou
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we present a detailed study of \emph{bonded knots} and their related structures, integrating recent developments into a single framework. Bonded knots are classical knots endowed with embedded bonding arcs modeling physical or chemical bonds. We consider bonded knots in three categories (long, standard, and tight) according to the type of bonds, and in two categories, topological vertex and rigid vertex, according to the allowed isotopy moves, and we define invariants for each category. We then develop the theory of \emph{bonded braids}, the algebraic counterpart of bonded knots. We define the {\it bonded braid monoid}, with its generators and relations, and formulate the analogues of the Alexander and Markov theorems for bonded braids, including an $L$-equivalence for bonded braids. Next, we introduce \emph{enhanced bonded knots and braids}, incorporating two types of bonds (attracting and repelling) corresponding to different interactions. We define the enhanced bonded braid group and show how the bonded braid monoid embeds into this group. Finally, we study \emph{bonded knotoids}, which are open knot diagrams with bonds, and their closure operations, and we define the \emph{bonded closure}. We introduce \emph{bonded braidoids} as the algebraic counterpart of bonded knotoids. These models capture the topology of open chains with inter and intra-chain bonds and suggest new invariants for classifying biological macromolecules.

Explore related subjects

math.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ioannis Diamantis, Louis H. Kauffman, Sofia Lambropoulou. 2025-12-06. Topology and Algebra of Bonded Knots and Braids. https://doi.org/10.3390/math13203260

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗