Related papers: DNA Origami and Unknotted A-trails in Torus Graphs
A graph $G$ embedded in a surface $S$ is called an $S$-grid when every facial boundary walk has length four, that is, the topological dual graph of $G$ in $S$ is 4-regular. Aside from the case where $S$ is the torus or Klein bottle, an…
We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…
The twisted torus knots K(p, q; r, s) are obtained by performing a sequence of s full twists on r adjacent strands of (p, q)-torus knots. Morimoto asked whether all twisted torus knots with essential tori in the exterior fit into one of two…
Knots and knotted fields enrich physical phenomena ranging from DNA and molecular chemistry to the vortices of fluid flows and textures of ordered media. Liquid crystals provide an ideal setting for exploring such topological phenomena…
The set consisting of all rotations of the Euclidean plane is equipped with a quandle structure. We show that a knot is colorable by this quandle if and only if its Alexander polynomial has a root on the unit circle in $\mathbb{C}$. Further…
We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…
Given a knot diagram $D$, we construct a semi-threading circle for it which can be an axis of $D$ as a closed braid depending on knot diagrams. In particular, we consider semi-threading circles for minimal diagrams of a knot with respect to…
The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree (resp. in a grid) are well studied graph classes. Recently we introduced the graph classes Edge-Intersecting and Non-Splitting Paths in a Tree ENPT, and in a Grid…
In this article we discuss applications of neural networks to recognising knots and, in particular, to the unknotting problem. One of motivations for this study is to understand how neural networks work on the example of a problem for which…
We determine p-colorability of the paradromic rings. These rings arise by generalizing the well-known experiment of bisecting a Mobius strip. Instead of joining the ends with a single half twist, use $m$ twists, and, rather than bisecting…
Knotted ribbons form an important topic in knot theory. They have applications in natural sciences, such as cyclic duplex DNA modeling. A flat knotted ribbon can be obtained by gently pulling a knotted ribbon tight so that it becomes flat…
We study the rational Kontsevich integral of torus knots. We construct explicitely a series of diagrams made of circles joined together in a tree-like fashion and colored by some special rational functions. We show that this series codes…
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…
A nut graph is a simple graph whose kernel is spanned by a single full vector (i.e. the adjacency matrix has a single zero eigenvalue and all non-zero kernel eigenvectors have no zero entry). We classify generalisations of nut graphs to nut…
The ongoing effort to detect and characterize physical entanglement in biopolymers has so far established that knots are present in many globular proteins and also abound in viral DNA packaged inside bacteriophages. RNA molecules, on the…
We give explicit deformations of embeddings of abstractly planar graphs that lie on the standard torus $T^2 \subset \mathbb{R}^3$ and that contain neither a nontrivial knot nor a nonsplit link into the plane. It follows that ravels do not…
A ribbon is, intuitively, a smooth mapping of an annulus $S^1 \times I$ in 3-space having constant width $\varepsilon$. This can be formalized as a triple $(x,\varepsilon, \mathbf{u})$ where $x$ is smooth curve in 3-space and $\mathbf{u}$…
Let $T$ be a tree, a vertex of degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$. For two distinct vertices $u,v$ of $T$, let $P_T[u,v]$ denote the unique path in $T$ connecting $u$ and $v.$ For a…
We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…
The early promises of DNA computing to deliver a massively parallel architecture well-suited to computationally hard problems have so far been largely unkept. Indeed, it is probably fair to say that only toy problems have been addressed…