Related papers: Recognizing trace graphs of closed braids

A novel self-assembly strategy for polypeptide nanostructure design was presented in [Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments, Nature Chemical Biology 9 (2013) 362--366]. The first mathematical…

We study the inertia of distance matrices of weighted graphs. Our novel congruence-based proof of the inertia of weighted trees extends to a proof for the inertia of weighted unicyclic graphs whose cycle is a triangle. Partial results are…

We introduce a monoid corresponding to knotted surfaces in four space, from its hyperbolic splitting represented by marked diagram in braid like form. It has four types of generators: two standard braid generators and two of singular type.…

A homeomorphism of a 3-manifold M is said to be Dehn twists on the boundary when its restriction to the boundary of M is isotopic to the identity on the complement of a collection of disjoint simple closed curves in the boundary of M. In…

Let a torus act on a compact oriented manifold $M$ with isolated fixed points, with an additional mild assumption that its isotropy submanifolds are orientable. We associate a signed labeled multigraph encoding the fixed point data (weights…

We study the theoretical and practical aspects of computing braids described by approximate descriptions of paths in the plane. Exact algorithms rely on the lexicographic ordering of the points in the plane, which is unstable under…

If a graph $G$ can be embedded on the torus, and be embedded linklessly in $\mathbb{R}^3$, it's not known whether or not we can always find a linkless embedding of $G$ contained in the standard (unknotted) torus; We show that, for orders 9…

Metrically homogeneous graphs are connected graphs which, when endowed with the path metric, are homogeneous as metric spaces. In this paper we introduce the concept of twisted automorphisms, a notion of isomorphism up to a permutation of…

In this survey paper we present the $L$--moves between braids and how they can adapt and serve for establishing and proving braid equivalence theorems for various diagrammatic settings, such as for classical knots, for knots in knot…

A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a signed graph is said to be positive (negative) if it has an even (odd) number of negative edges, counting repetition. Recognizing the signs of…

We show that every trivial 3-strand braid diagram contains a disk, defined as a ribbon ending in opposed crossings. Under a convenient algebraic form, the result extends to every Artin--Tits group of dihedral type, but it fails to extend to…

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…

Two virtual link diagrams are homotopic if one may be transformed into the other by a sequence of virtual Reidemeister moves, classical Reidemeister moves, and self crossing changes. We recall the pure virtual braid group. We then describe…

This paper concerns on linked periodic orbits of orientation-preserving homeomorphisms of the $2$-disc in the sense of Gambaudo. We interpret the linking of periodic orbits by using their induced braids. Then based on the forcing relation…

In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…

Given a braided pivotal category $\mathcal C$ and a pivotal module tensor category $\mathcal M$, we define a functor $\mathrm{Tr}_{\mathcal C}:\mathcal M \to \mathcal C$, called the associated categorified trace. By a result of…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…

Honeycomb toroidal graphs are trivalent Cayley graphs on generalized dihedral groups. We examine the two historical threads leading to these graphs, some of the properties that have been established, and some open problems.

A transverse knot is a knot that is transverse to the planes of the standard contact structure on real 3-space. In this paper we prove the Markov Theorem for transverse braids, which states that two transverse closed braids that are…