Related papers: On the Coloring of Pseudoknots
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
The cosmetic crossing conjecture posits that switching a non-trivial crossing in a knot diagram always changes the knot type. Generalizing work of Balm, Friedl, Kalfagianni and Powell, and of Lidman and Moore, we give an Alexander…
We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph…
This paper introduces gluing diagrams a combinatorial tool to construct homomorphisms between the shift pseudogroups of directed graphs and thus also their full groups of shifts. We will establish which of these diagrams produce…
A properly edge-colored graph is a graph with a coloring of its edges such that no vertex is incident to two or more edges of the same color. A subgraph is called rainbow if all its edges have different colors. The problem of finding…
The aim of this paper is to define certain algebraic structures coming from generalized Reidemeister moves of singular knot theory. We give examples, show that the set of colorings by these algebraic structures is an invariant of singular…
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…
Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes…
The knots-quivers correspondence states that various characteristics of a knot are encoded in the corresponding quiver and the moduli space of its representations. However, this correspondence is not a bijection: more than one quiver may be…
For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…
Dual graphs have been applied to model RNA secondary structures. The purpose of the paper is two-fold: we present new graph-theoretic properties of dual graphs to validate the further analysis and classification of RNAs using these…
Using the Huynh and Le quantum determinant description of the colored Jones polynomial, we construct a new combinatorial description of the colored Jones polynomial in terms of walks along a braid. We then use this description to show that…
We define a traced pseudomonoid as a pseudomonoid in a monoidal bicategory equipped with extra structure, giving a new characterisation of Cauchy complete traced monoidal categories as algebraic structures in Prof, the monoidal bicategory…
In this paper we introduce a representation of knots and links called a cube diagram. We show that a property of a cube diagram is a link invariant if and only if the property is invariant under two types of cube diagram operations. A knot…
A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, the…
We introduce an equivalence relation, called stable equivalence, on knot diagrams and closed curves on surfaces. We give bijections between the set of abstract knots, the set of virtual knots, and the set of the stable equivalence classes…
A lattice model of RNA denaturation which fully accounts for the excluded volume effects among nucleotides is proposed. A numerical study shows that interactions forming pseudoknots must be included in order to get a sharp continuous…
A subcoloring of a graph is a partition of its vertex set into subsets (called colors), each inducing a disjoint union of cliques. It is a natural generalization of the classical proper coloring, in which each color must instead induce an…