Related papers: Categorifying Coloring Numbers
This paper demonstrates a topological meaning of quandle cocycle invariants of links with respect to finite connected quandles $X$, from a perspective of homotopy theory: Specifically, for any prime $\ell$ which does not divide the type of…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
This is a survey talk on one of the best known quantum knot invariants, the colored Jones polynomial of a knot, and its relation to the algebraic/geometric topology and hyperbolic geometry of the knot complement. We review several aspects…
A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic…
In most studies related to colouring of graphs and perhaps in the study of other invariants and variants of graphs, the restrictions of non-triviality and connectedness are placed upon graphs. For the introduction to comp\^{o}nent\u{a}…
Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…
In CJKLS quandle cohomology is used to produce invariants for particular embeddings of codimension two; 2-cocycles give to invariants for (classical) knots and 3-cocycles give rise to invariants for knotted surfaces. This is done by way of…
The curling number of a graph G is defined as the number of times an element in the degree sequence of G appears the maximum. Graph colouring is an assignment of colours, labels or weights to the vertices or edges of a graph. A colouring…
K. Cho and S. Nelson introduced the notion of a quandle coloring quiver, which is a quiver-valued link invariant, and a quandle cocycle quiver which is an enhancement of the quandle coloring quiver by assigning to each vertex a weight…
In this paper we define the fundamental quandle of knotoids and linkoids and prove that it is invariant under the under forbidden-move and hence encodes only the information of the underclosure of the knotoid. We then introduce $n$-pointed…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
We introduce and investigate dichromatic singular links. We also construct G-Family of singquandles and use them to define counting invariants for unoriented dichromatic singular links. We provide some examples to show that these invariants…
We initiate the study of classical knots through the homotopy class of the n-th evaluation map of the knot, which is the induced map on the compactified n-point configuration space. Sending a knot to its n-th evaluation map realizes the…
We show that quandle rings and their idempotents lead to proper enhancements of the well-known quandle coloring invariant of links in the 3-space. We give explicit examples to show that the new invariants are also stronger than the $\Hom$…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
More than ten years ago in 2008, a new kind of graph coloring appeared in graph theory, which is the {\it rainbow connection coloring} of graphs, and then followed by some other new concepts of graph colorings, such as {\it proper…
We introduce a new invariant of tangles along with an algebraic framework in which to understand it. We claim that the invariant contains the classical Alexander polynomial of knots and its multivariable extension to links. We argue that of…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As…
We define the affinization of an arbitrary monoidal category $\mathcal{C}$, corresponding to the category of $\mathcal{C}$-diagrams on the cylinder. We also give an alternative characterization in terms of adjoining dot generators to…