Related papers: Coloring invariants of spatial graphs
In this paper, we study Dehn colorings for spatial graphs, and give a family of spatial graph invariants that are called vertex-weight invariants. We give some examples of spatial graphs that can be distinguished by a vertex-weight…
We introduce the notion of a hierarchical quandle, which is a generalisation of diquandles and multi-quandles. Using hierarchical quandle colourings, we construct a cocycle invariants for links coloured by quandles.
We incorporate quandle cocycle information into the quandle coloring quivers we defined in arXiv:1807.10465 to define weighted directed graph-valued invariants of oriented links we call \textit{quandle cocycle quivers}. This construction…
By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle…
Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…
While knotoids on the sphere are well-understood by a variety of invariants, knotoids on the plane have proven more subtle to classify due to their multitude over knotoids on the sphere and a lack of invariants that detect a diagram's…
We introduce the notion of a quandle with a good involution and its homology groups. Carter et al. defined quandle cocycle invariants for oriented links and oriented surface-links. By use of good involutions, quandle cocyle invariants can…
We show how to define invariants of graphs related to quantum $\mathfrak{sl}(2)$ when the graph has more then one connected component and components are colored by blocks of representations with zero quantum dimensions.
We define new invariants of knots by means of quandle colorings and longitudinal information. These invariants can be applied to a tangle embedding problem and recognizing non-classical virtual knots.
Quandle coloring quivers are directed graph-valued invariants of oriented knots and links, defined using a choice of finite quandle $X$ and set $S\subset\mathrm{Hom}(X,X)$ of endomorphisms. From a quandle coloring quiver, a polynomial knot…
Biquandles are generalizations of quandles. As well as quandles, biquandles give us many invariants for oriented classical/virtual/surface links. Some invariants derived from biquandles are known to be stronger than those from quandles for…
We introduce a notion of topological quandle. Given a topological quandle $Q$ we associate to every classical link $L$ in $\R ^3$ an invariant $J_Q(L)$ which is a topological space (defined up to a homeomorphism). The space $J_Q(L)$ can be…
The fundamental quandle is a complete invariant for unoriented tame knots \cite{JO, Ma} and non-split links \cite{FR}. The proof involves proving a relationship between the components of the fundamental quandle and the cosets of the…
We define a two-variable polynomial invariant of finite quandles. In many cases this invariant completely determines the algebraic structure of the quandle up to isomorphism. We use this polynomial to define a family of link invariants…
We study tangle replacement in the context of spatial graphs. The main results show that, for certain spatial handcuff graphs, there is a one-to-one correspondence between the neighborhood equivalence classes of the spatial graphs obtained…
In this paper, we study Dehn colorings of spatial graph diagrams, and classify the vertex conditions, equivalently the palettes. We give some example of spatial graphs which can be distinguished by the number of Dehn colorings with…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
The fundamental quandle is a powerful invariant of knots, links and spatial graphs, but it is often difficult to determine whether two quandles are isomorphic. One approach is to look at quotients of the quandle, such as the $n$-quandle…
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…
The state-sum invariants for knots and knotted surfaces defined from quandle cocycles are described using the Kronecker product between cycles represented by colored knot diagrams and a cocycle of a finite quandle used to color the diagram.…