Related papers: Rectangular Seifert circles and arcs system
Rationally null-homologous links in Seifert fibered spaces may be represented combinatorially via labeled diagrams. We introduce an additional condition on a labeled link diagram and prove that it is equivalent to the existence of a…
Tait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be connected by a finite sequence of flypes, is extended to reduced, alternating, prime diagrams of 4-regular graphs in S^3. The proof of this version…
If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of…
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…
This note has an experimental nature and contains no new theorems. We introduce certain moves for classical knot diagrams that for all the very many examples we have tested them on give a monotonic complete simplification. A complete…
In an earlier paper we introduced rectangular diagrams of surfaces and showed that any isotopy class of a surface in the three-sphere can be presented by a rectangular diagram. Here we study transformations of those diagrams and introduce…
Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal…
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to…
A string figure is topologically a trivial knot lying on an imaginary plane orthogonal to the fingers with some crossings. The fingers prevent cancellation of these crossings. As a mathematical model of string figure we consider a knot…
Given a reduced alternating diagram for a link, we obtain conditions that guarantee that the link complement has a complete hyperbolic structure, crossing arcs are the edges of an ideal geodesic triangulation, and every crossing arc is…
A crown diagram of a smooth, closed oriented 4-manifold can be thought of as the projection of a link in the product of a closed surface and the circle, with chords in the circle direction connecting the strands of each crossing. This paper…
A linkage mechanism consists of rigid bodies assembled by joints which can be used to translate and transfer motion from one form in one place to another. In this paper, we are particularly interested in a family of spacial linkage…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into…
A link $L$ in $S^3$ is called a symmetric link if it is preserved by a $\pi$ rotation around a closed geodesic in $S^3$. Any symmetric link can be depicted by a diagram with a symmetry axis lying on the plane of the diagram, called a…
Analogous to a classical knot diagram, a surface-link can be generically projected to 3-space and given crossing information to create a broken sheet diagram. The triple point number of a surface-link is the minimal number of triple points…
We study recursive cubes of rings as models for interconnection networks. We first redefine each of them as a Cayley graph on the semidirect product of an elementary abelian group by a cyclic group in order to facilitate the study of them…
Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one…
The manuscript describes fast and scalable architectures and associated algorithms for computing convolutions and cross-correlations. The basic idea is to map 2D convolutions and cross-correlations to a collection of 1D convolutions and…
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…