Related papers: Categorifying Coloring Numbers
We study the Fox coloring invariants of rational knots. We express the propagation of the colors down the twists of these knots and ultimately the determinant of them with the help of finite increasing sequences whose terms of even order…
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 large size limit of matrix integrals with quartic potential may be used to count alternating links and tangles. The removal of redundancies amounts to renormalizations of the potential. This extends into two directions: higher genus and…
A table of the families of alternating knots formed by conways is presented. The Conway's function is shown with the use of linear algebra in terms of natural numbers, called conways, that represent the number of crossings along a…
The isomorphism type of the knot quandle introduced by Joyce is a complete invariant of tame knots. Whether two quandles are isomorphic is in practice difficult to determine; we show that this question is provably hard: isomorphism of…
Color coding is an algorithmic technique used in parameterized complexity theory to detect "small" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable,…
The central discovery of $2d$ conformal theory was holomorphic factorization, which expressed correlation functions through bilinear combinations of conformal blocks, which are easily cut and joined without a need to sum over the entire…
We use categorical skew Howe duality to find recursion rules that compute categorified sl(N) invariants of rational tangles colored by exterior powers of the standard representation. Further, we offer a geometric interpretation of these…
The extension of the knot group $\pi_1(S^3\setminus K)$ to the category of tangles is introduced via a new category-theoretic construction. Through this presentation, a new avenue of proof for results about knot groups is opened.
We introduce colorings of oriented surface-links by biquasiles using marked graph diagrams. We use these colorings to define counting invariants and Boltzmann enhancements of the biquasile counting invariants for oriented surface-links. We…
We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient…
We generalize the colored Jones polynomial to $4$-valent graphs. This generalization is given as a sequence of invariants in which the first term is a one variable specialization of the Kauffman-Vogel polynomial. We use the invariant we…
Introducing a way to modify knots using $n$-trivial rational tangles, we show that knots with given values of Vassiliev invariants of bounded degree can have arbitrary unknotting number (extending a recent result of Ohyama, Taniyama and…
Involutive category theory provides a flexible framework to describe involutive structures on algebraic objects, such as anti-linear involutions on complex vector spaces. Motivated by the prominent role of involutions in quantum (field)…
A kei, or 2-quandle, is an algebraic structure one can use to produce a numerical invariant of links, known as coloring invariants. Motivated by Mazur's analogy between prime numbers and knots, we define for every finite kei $\mathcal{K}$…
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…
In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in…
This paper shows how the study of colored compositions of integers reveals some unexpected and original connection with the Invert operator. The Invert operator becomes an important tool to solve the problem of directly counting the number…
Racks and quandles are rich algebraic structures that are strong enough to classify knots. Here we develop several fundamental categorical aspects of the theories of racks and quandles and their relation to the theory of permutations. In…
We use the machinery of categorified Jones-Wenzl projectors to construct a categorification of a type A Reshetikhin-Turaev invariant of oriented framed tangles where each strand is labeled by an arbitrary finite-dimensional representation.…