Related papers: On the Coloring of Pseudoknots
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.
Cactus doodles are combinatorial/geometric objects that are related to cactus groups in the same way as knots are related to braids. We define them in terms of local moves on plane curves, show that they can be obtained from elements of the…
(Pseudo) double categories have two sorts of morphisms: tight ones which compose strictly, and loose ones which compose up to coherent isomorphism. In this paper, we consider bimodules between double categories in the loose direction. We…
We introduce two new families of polynomial invariants of oriented classical and virtual knots and links defined as decategorfications of the quandle coloring quiver. We provide examples to illustrate the computation of the invariants, show…
Dot product embeddings take a graph and construct vectors for nodes such that dot products between two vectors give the strength of the edge. Dot products make a strong transitivity assumption, however, many important forces generating…
We enumerate possible topologies of pseudoknots in single-stranded RNA molecules. We use a steepest-descent approximation in the large N matrix field theory, and a Feynman diagram formalism to describe the resulting pseudoknot structure.
We study random knotting by considering knot and link diagrams as decorated, (rooted) topological maps on spheres and pulling them uniformly from among sets of a given number of vertices $n$, as first established in recent work with…
The definition of a pseudo-dualizing complex is obtained from that of a dualizing complex by dropping the injective dimension condition, while retaining the finite generatedness and homothety isomorphism conditions. In the specific setting…
I used to believe that my conventions for drawing diagrams for categorical statements could be written down in one page or less, and that the only tricky part was the technique for reconstructing objects "from their names"... but then I…
The colored Jones function of a knot is a sequence of Laurent polynomials in one variable, whose n-th term is the Jones polynomial of the knot colored with the n-dimensional irreducible representation of SL(2). It was recently shown by TTQ…
We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub-coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global…
The odd diagram of a permutation is a subset of the classical diagram with additional parity conditions. In this paper, we study classes of permutations with the same odd diagram, which we call odd diagram classes. First, we prove a…
We call a Delta Diagram any diagram of a knot or link whose regions (including the unbounded one) have 3, 4, or 5 sides. We prove that any knot or link admits a delta diagram. We define and estimate combinatorial link invariants stemming…
Related to a semigroup of operators on a metric measure space, we define and study pseudodifferential operators (including the setting of Riemannian manifold, fractals, graphs ...). Boundedness on $L^p$ for pseudodifferential operators of…
We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms…
This paper is a survey of knot theory and invariants of knots and links from the point of view of categories of diagrams. The topics range from foundations of knot theory to virtual knot theory and topological quantum field theory.
Computing the gradient of an image is a common step in computer vision pipelines. The image gradient quantifies the magnitude and direction of edges in an image and is used in creating features for downstream machine learning tasks.…
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…
In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…
A doodle is a collection of immersed circles without triple intersections in the $2$-sphere. It was shown by the second author and P.~Tayler that doodles induce commutator identities (identities amongst commutators) in a free group. In this…