Search arXivSearch

arXiv · 2412.16808

The Theory of Doubly Periodic Pseudo Tangles

Abstract

Doubly periodic tangles (DP tangles) are configurations of curves embedded in the thickened plane, invariant under translations in two transversal directions. In this paper we extend the classical theory of DP tangles by introducing the theory of {\it doubly periodic pseudo tangles} (pseudo DP tangles), which incorporate undetermined crossings called {\it precrossings}, inspired by the theory of pseudo knots. Pseudo DP tangles are defined as liftings of spatial pseudo links in the thickened torus, called {\it pseudo motifs}, and are analyzed through diagrammatic methods that account for both local and global isotopies. We emphasize on {\it pseudo cover equivalence}, a concept defining equivalence between finite covers of pseudo motif diagrams. We investigate the notion of equivalence for these structures, leading to an analogue of the Reidemeister theorem for pseudo DP tangles. Furthermore, we address the complexities introduced by pseudo cover equivalence in defining minimal pseudo motif diagrams. This work contributes to the broader understanding of periodic entangled structures and can find applications in diverse fields such as textiles, materials science and crystallography due to their periodic nature.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ioannis Diamantis, Sofia Lambropoulou, Sonia Mahmoudi. 2025-08-19. The Theory of Doubly Periodic Pseudo Tangles. https://arxiv.org/abs/2412.16808

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