Related papers: Quandle Coloring Quivers of Surface-Links
Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$,…
We construct invariants of colored links using equivariant bordism groups of Conner and Floyd. We employ this bordism invariant to find the first examples of topological vortex knots, the knot structure of which is protected from decaying…
Geometric representations of cycles in quandle homology theory are given in terms of colored knot diagrams. Abstract knot diagrams are generalized to diagrams with exceptional points which, when colored, correspond to degenerate cycles.…
A marked strongly invertible knot is a triple $(K,h,\delta)$ of a knot $K$ in $S^3$, a strong inversion $h$ of $K$, and a subarc $\delta \subset \operatorname{Fix}(h)\cong S^1$ bounded by $\operatorname{Fix}(h)\cap K\cong S^0$. An invariant…
We equip a knot $K$ with a set of colored bonds, that is, colored intervals properly embedded into $\mathbb{R}^3 \setminus K$. Such a construction can be viewed as a structure that topologically models a closed protein chain including any…
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented…
We define a functor $\mathcal{Q}$ from the category of multiple conjugation biquandles to that of multiple conjugation quandles. We show that for any multiple conjugation biquandle $X$, there is a one-to-one correspondence between the set…
A polynomial invariant of virtual links, arising from an invariant of links in thickened surfaces introduced by Jaeger, Kauffman, and Saleur, is defined and its properties are investigated. Examples are given that the invariant can detect…
We define enhancements of the quandle counting invariant for knots and links with a finite labeling quandle Q embedded in the quandle of units of a Lie algebra \mathfrak{a} using Lie ideals. We provide examples demonstrating that the…
An {\em odd subgraph} of a graph is a subgraph in which every vertex has odd degree. A graph $G$ is said to be {\em odd $k$-edge-colorable} if there exists an edge-coloring $E(G) \rightarrow \{1,2, \ldots, k\}$ such that each non-empty…
We explain a correspondence between some invariants in the dynamics of color exchange in a 2d coloring problem, which are polynomials of winding numbers, and linking numbers in 3d. One invariant is visualized as linking of lines on a…
We define a q-chromatic function on graphs, list some of its properties and provide some formulas in the class of general chordal graphs. Then we relate the q-chromatic function to the colored Jones function of knots. This leads to a…
Fox coloring provides a combinatorial framework for studying dihedral representations of the knot group. The less well-known concept of Dehn coloring captures the same data. Recent work of Carter-Silver-Williams clarifies the relationship…
Knot colorings are one of the simplest ways to distinguish knots, dating back to Reidemeister, and popularized by Fox. In this mostly expository article, we discuss knot invariants like colorability, knot determinant and number of…
We generalize the notion of biquandles to psyquandles and use these to define invariants of oriented singular links and pseudolinks. In addition to psyquandle counting invariants, we introduce Alexander psyquandles and corresponding…
Polynomials on stranded graphs are higher dimensional generalization of Tutte and Bollob\'as-Riordan polynomials [Math. Ann. 323 (2002), 81-96]. Here, we deepen the analysis of the polynomial invariant defined on rank 3 weakly-colored…
We investigate the relationship between the quandle and biquandle coloring invariant and obtain an enhancement of the quandle and biquandle coloring invariants using biquandle structures. We also continue the study of biquandle…
We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…
Quandle homology theory has been developed and cocycles have been used to define invariants of oriented classical or surface links. We introduce a shifting chain map $\sigma$ on each quandle chain complex that lowers the dimensions by one.…
We study the existence of periodic colorings and orientations in locally finite graphs. A coloring or orientation of a graph $G$ is periodic if the resulting colored or oriented graph is quasi-transitive, meaning that $V(G)$ has finitely…