Related papers: Over then Under Tangles
The OU matrix of a braid diagram is a square matrix that represents the number of over/under crossings of each pair of strands. In this paper, the OU matrix of a pure braid diagram is characterized for up to 5 strands. As an application,…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
We study a question that lies at the intersection of classical research subjects in Topological Graph Theory and Graph Drawing: Computing a drawing of a graph with a prescribed number of crossings on a given set $S$ of points, while…
Braiding operators corresponding to the third Reidemeister move in the theory of knots and links are realized in terms of parametrized unitary matrices for all dimensions. Two distinct classes are considered. Their (non-local) unitary…
While many graph drawing algorithms consider nodes as points, graph visualization tools often represent them as shapes. These shapes support the display of information such as labels or encode various data with size or color. However, they…
It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with…
This paper provides a conceptual study of the twisting procedure, which amounts to create functorially new differential graded Lie algebras, associative algebras or operads (as well as their homotopy versions) from a Maurer--Cartan element.…
A tangle is an oriented 1-submanifold of the cylinder whose endpoints lie on the two disks in the boundary of the cylinder. Using an algebraic tool developed by Lescop, we extend the Burau representation of braids to a functor from the…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…
Traditional machine learning methods heavily rely on the independent and identically distribution assumption, which imposes limitations when the test distribution deviates from the training distribution. To address this crucial issue,…
A binary tanglegram is a pair <S,T> of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics or software engineering, it is required…
A bottom tangle is a tangle in a cube consisting only of arc components, each of which has the two endpoints on the bottom line of the cube, placed next to each other. We introduce a subcategory B of the category of framed, oriented…
The $k$-truss, introduced by Cohen (2005), is a graph where every edge is incident to at least $k$ triangles. This is a relaxation of the clique. It has proved to be a useful tool in identifying cohesive subnetworks in a variety of…
We study the enumeration of alternating links and tangles, considered up to topological (flype) equivalences. A weight $n$ is given to each connected component, and in particular the limit $n\to 0$ yields information about (alternating)…
Underwater object detection (UOD), aiming to identify and localise the objects in underwater images or videos, presents significant challenges due to the optical distortion, water turbidity, and changing illumination in underwater scenes.…
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…
It is argued that the T-dual of a crosscap is a combination of an O+ and an O- orientifold plane. Various theories with crosscaps and D-branes are interpreted as gauge-theories on tori obeying twisted boundary conditions. Their duals live…
Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that often occur together. They can thereby discover, relate, and structure types: of behaviour,…
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…