Related papers: Dehn coloring and the dimer model for knots

We improve the lower bound for the minimum number of colors for linear Alexander quandle colorings of a knot given in Theorem 1.2 of Colorings beyond Fox: The other linear Alexander quandles (Linear Algebra and its Applications, Vol. 548,…

The knot coloring polynomial defined by Eisermann for a finite pointed group is generalized to an infinite pointed group as the longitudinal mapping invariant of a knot. In turn this can be thought of as a generalization of the quandle…

Fractional Dehn twists give a measure of the difference between the relative isotopy class of a homeomorphism of a bordered surface and the Thurston representative of its free isotopy class. We show how to estimate and compute these…

This paper embodies the Fox's ${\mathcal H}$-transform theory into a unifying modeling and analysis of HetNets. The proposed framework has the potential, due to the Fox's ${\mathcal H}$-functions versatility, of significantly simplifying…

Node coloring is the task of assigning colors to the nodes of a graph such that no two adjacent nodes have the same color, while using as few colors as possible. It is the most widely studied instance of graph coloring and of central…

The bridge index and superbridge index of a knot are important invariants in knot theory. We define the bridge map of a knot conformation, which is closely related to these two invariants, and interpret it in terms of the tangent indicatrix…

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…

Data science offers a powerful tool to understand objects in multiple sciences. In this paper we utilize concept of data science, most notably topological data analysis, to extend our understanding of knot theory. This approach provides a…

Graph coloring is fundamental to distributed computing. We give the first sub-logarithmic distributed algorithm for coloring cluster graphs. These graphs are obtained from the underlying communication network by contracting nodes and edges,…

We introduce twisted set-theoretic Yang-Baxter solutions and develop an associated cohomology theory, which extends the standard cohomology theory of Yang-Baxter solutions. By employing cocycles of twisted biquandles along with Alexander…

Recent results of J.Gu and H.Jockers provide the lacking initial conditions for the evolution method in the case of the first non-trivially colored HOMFLY polynomials H_{[21]} for the family of twist knots. We describe this application of…

Fix $d\ge2$ and consider a uniformly random set $P$ of $n$ points in $[0,1]^{d}$. Let $G$ be the Hasse diagram of $P$ (with respect to the coordinatewise partial order), or alternatively let $G$ be the Delaunay graph of $P$ with respect to…

The homset invariant of a knot or link L with respect to an algebraic knot coloring structure X can be identified with a set of colorings of a diagram of L by elements of X via an identification of diagrammatic generators with algebraic…

Construction of representations of braid group generators from $N$-state vertex models provide an elegant route to study knot and link invariants. Using such a braid group representation, an algebraic formula for the link invariants was put…

This paper is an introduction to the state sum model for the Alexander-Conway polynomial that was introduced in the the author's book "Formal Knot Theory" (Princeton University Press, 1983). The article outlines how Alexander's original…

Transfer-Matrix Methods originated in physics where they were used to count the number of allowed particle states on a structure whose width $n$ is a parameter. Typically, the number of states is exponential in $n.$ One more mathematical…

We have recently proposed arXiv:2105.11565 a powerful method for computing group factors of the perturbative series expansion of the Wilson loop in the Chern-Simons theory with $SU(N)$ gauge group. In this paper, we apply the developed…

For graphs $G$ and $H$, an $H$-coloring of $G$ is an edge-preserving mapping from $V(G)$ to $V(H)$. In the $H$-Coloring problem the graph $H$ is fixed and we ask whether an instance graph $G$ admits an $H$-coloring. A generalization of this…

We consider the space of all representations of the commutator subgroup of a knot group into a finite abelian group {\Sigma}, together with a shift map {\sigma}_x. This is a finite dynamical system, introduced by D.Silver and S. Williams.…

Besides offering a friendly introduction to knot homologies and quantum curves, the goal of these lectures is to review some of the concrete predictions that follow from the physical interpretation of knot homologies. In particular, this…