Related papers: Parallelization of Welded Links
Twisted links are a generalization of virtual links. As virtual links correspond to abstract links on orientable surfaces, twisted links correspond to abstract links on (possibly non-orientable) surfaces. In this paper, we introduce the…
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)…
Braidoids form a counterpart theory to the theory of planar knotoids, just as braids do for three-dimensional links. As such, planar knotoid diagrams represent the same knotoid in $\mathbb{R}^2$ if and only if they can be presented as the…
The arrow polynomial is an invariant of framed oriented virtual links that generalizes the virtual Kauffman bracket. In this paper we define the homological arrow polynomial, which generalizes the arrow polynomial to framed oriented virtual…
A realization of a virtual link diagram is obtained by choosing over/under markings for each virtual crossing. Any realization can also be obtained from some representation of the virtual link. (A representation of a virtual link is a link…
A partial edge drawing (PED) of a graph is a variation of a node-link diagram. PED draws a link, which is a partial visual representation of an edge, and reduces visual clutter of the node-link diagram. However, more time is required to…
A virtual link diagram is called mod $m$ almost classical if it admits an Alexander numbering valued in integers modulo $m$, and a virtual link is called mod $m$ almost classical if it has a mod $m$ almost classical diagram as a…
A biquandle is a solution to the set-theoretical Yang-Baxter equation, which yields invariants for virtual knots such as the coloring number and the state-sum invariant. A virtual biquandle enriches the structure of a biquandle by…
In this paper, we consider local moves on classical and welded diagrams of string links, and the notion of welded extension of a classical move. Such extensions being non-unique in general, the idea is to find a topological criterion which…
The braid indices of most links remain unknown as there is no known universal method that can be used to determine the braid index of an arbitrary knot. This is also the case for alternating knots. In this paper, we show that if $K$ is an…
Any knot diagram can be transformed into the unknot by a series of unknotting operations. This paper introduces the diagonal move, a novel unknotting operation that generalizes and unifies several existing moves. We prove that the diagonal…
We present Regularized Linear Embedding (RLE), a novel method that projects a collection of linked documents (e.g. citation network) into a pretrained word embedding space. In addition to the textual content, we leverage a matrix of…
It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due…
We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…
A linked system of symmetric designs (LSSD) is a $w$-partite graph ($w\geq 2$) where the incidence between any two parts corresponds to a symmetric design and the designs arising from three parts are related. The original construction for…
The paper presents a methodology to enhance the stiffness analysis of parallel manipulators with parallelogram-based linkage. It directly takes into account the influence of the external loading and allows computing both the non-linear…
Usage of multiprocessor and multicore computers implies parallel programming. Tools for preparing parallel programs include parallel languages and libraries as well as parallelizing compilers and convertors that can perform automatic…
Neural networks are famously nonlinear. However, linearity is defined relative to a pair of vector spaces, $f:X \to Y$. Leveraging the algebraic concept of transport of structure, we propose a method to explicitly identify non-standard…
We address the problem of defining graph transformations by the simultaneous application of direct transformations even when these cannot be applied independently of each other. An algebraic approach is adopted, with production rules of the…
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…