Related papers: Rectangular Seifert circles and arcs system
Scaffolds are certain tensors arising in the study of association schemes, and have been (implicitly) understood diagrammatically as digraphs with distinguished "root" nodes and with matrix edge weights, often taken from Bose-Mesner…
Given a link map f into a manifold of the form Q = N \times \Bbb R, when can it be deformed to an unlinked position (in some sense, e.g. where its components map to disjoint \Bbb R-levels) ? Using the language of normal bordism theory as…
Jin and Lee proved the following: Suppose that $D_1, \dots, D_n$ are link diagrams. Given a link $L$ which is partitioned into sublinks $L_1, \dots, L_n$ admitting diagrams $D_1, \dots, D_n$ respectively, there is a diagram $D$ of $L$ whose…
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…
Lee homology (a variant of Khovanov homology) over $\mathbb{Q}$ possesses the "canonical generators" as its basis. The generators (Lee's classes) $[\alpha(D, o)]$ are constructed combinatorially from an oriented link diagram $D$, one for…
In 2002, D. Hrencecin and L.H. Kauffman defined a filamentation invariant on oriented chord diagrams that may determine whether the corresponding flat virtual knot diagrams are non-trivial. A virtual knot diagram is non-classical if its…
We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.
Let $L$ be an alternating prime non-split link in $S^3$. We use the category of flypes between reduced alternating diagrams for $L$ to classify involutions on $L$. As consequences, we show that the quotient of an alternating periodic link…
Recent developments in machine-learning based molecular fragment linking have demonstrated the importance of informing the generation process with structural information specifying the relative orientation of the fragments to be linked.…
In this paper we study some aspects of knots and links in lens spaces. Namely, if we consider lens spaces as quotient of the unit ball $B^{3}$ with suitable identification of boundary points, then we can project the links on the equatorial…
We introduce and study knotoids. Knotoids are represented by diagrams in a surface which differ from the usual knot diagrams in that the underlying curve is a segment rather than a circle. Knotoid diagrams are considered up to Reidemeister…
Let $D$ be an oriented classical or virtual link diagram with directed universe $\vec{U}$. Let $C$ denote a set of directed Euler circuits, one in each connected component of $U$. There is then an associated looped interlacement graph…
We describe a model of random links based on random 4-valent maps, which can be sampled due to the work of Schaeffer. We will look at the relationship between the combinatorial information in the diagram and the hyperbolic volume.…
This paper extends the study of arc crossing change, a local operation on knot diagrams recently introduced by Cericola, from knot diagrams to link diagrams. We consider two types of arc crossing change on link diagrams and discuss when…
A catacondensed even ring system (shortly CERS) is a simple bipartite 2-connected outerplanar graph with all vertices of degree 2 or 3. In this paper, we investigate the resonance graphs (also called $Z$-transformation graphs) of CERS and…
In a recent work "Arc-presentation of links: Monotonic simplification" Ivan Dynnikov showed that each rectangular diagram of the unknot, composite link, or split link can be monotonically simplified into a trivial, composite, or split…
There is one generalization of fibered links in 3-manifolds, called homologically fibered links. It is known that the existence of homologically fibered links whose fiber surface has a given homeomorphic type is determined by the first…
A bicirculant is a regular graph that admits an automorphism having two vertex-orbits of the same size. A bicirculant can be described as follows. Given an integer $m \ge 1$ and sets $R, S, T \subseteq \mathbb Z_m$ such that $R=-R$, $T=-T$,…
A rigidity circuit (in 2D) is a minimal dependent set in the rigidity matroid, i.e. a minimal graph supporting a non-trivial stress in any generic placement of its vertices in $\mathbb R^2$. Any rigidity circuit on $n\geq 5$ vertices can be…