arXiv 0803.16422008-03-11math.GTmath.CT

Categorifying Coloring Numbers

John Armstrong

备注：: To appear in "Interactions between Representation Theory, Quantum Field Theory, Category Theory, and Quantum Information Theory" conference proceedings

英文摘要：

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 and links with free ends? Indeed we can, once we categorify. Starting from the definition of coloring numbers, we will categorify them and establish this extension to tangles. Then, decategorifying will leave us with matrix representations of the monoidal category of tangles.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Categorifying fractional Euler characteristics, Jones-Wenzl projector and $3j$-symbols

We study the representation theory of the smallest quantum group and its categorification. The first part of the paper contains an easy visualization of the 3j-symbols in terms of weighted signed line arrangements in a fixed triangle and new binomial expressions for the 3j-symbols. All these formulas are realized as graded Euler characteristics. The 3j-symbols appear as new generalizations of Kazhdan-Lusztig polynomials. A crucial result of the paper is that complete intersection rings can be employed to obtain rational Euler characteristics, hence to categorify rational quantum numbers. This …

2011-05-16math-phmath.GTmath.MP

Minimal coloring number for Z-colorable links

For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is the minimal number of colors for non-trivial Z-colorings on diagrams of the link. We give sufficient conditions for non-splittable Z-colorable links to have the least minimal coloring number.

2016-05-26math.GT

Minimal coloring numbers on minimal diagrams of torus links

We determine the minimal number of colors for non-trivial $\mathbb{Z}$-colorings on the standard minimal diagrams of $\mathbb{Z}$-colorable torus links. Also included are complete classifications of such $\mathbb{Z}$-colorings and of such $\mathbb{Z}$-colorings by only four colors, which are shown by using rack colorings on link diagrams.

2019-08-02math.GT

Minimal coloring number for $\mathbb{Z}$-colorable links II

The minimal coloring number of a $\mathbb{Z}$-colorable link is the minimal number of colors for non-trivial $\mathbb{Z}$-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable $\mathbb{Z}$-colorable links is four. As an example, we consider the link obtained by replacing each component of the given link with several parallel strands, which we call a parallel of a link. We show that an even parallel of a link is $\mathbb{Z}$-colorable except for the case of 2 parallels with non-zero linking number. We then give a simple way to obtain a …

2017-08-03math.GT

On the minimum number of Fox Colorings of Knots

We investigate Fox colorings of knots that are 17-colorable. Precisely, we prove that any 17-colorable knot has a diagram such that exactly 6 among the seventeen colors are assigned to the arcs of the diagram.

2020-09-26math.GT

Minimal coloring number on minimal diagrams for $\mathbb{Z}$-colorable links

It was shown that any $\mathbb{Z}$-colorable link has a diagram which admits a non-trivial $\mathbb{Z}$-coloring with at most four colors. In this paper, we consider minimal numbers of colors for non-trivial $\mathbb{Z}$-colorings on minimal diagrams of $\mathbb{Z}$-colorable links. We show, for any positive integer $N$, there exists a minimal diagram of a $\mathbb{Z}$-colorable link such that any $\mathbb{Z}$-coloring on the diagram has at least $N$ colors. On the other hand, it is shown that certain $\mathbb{Z}$-colorable torus links have minimal diagrams admitting $\mathbb{Z}$-colorings wit…

2017-12-23math.GT

更多相关论文收起更多论文

The Minimal Coloring Number Of Any Non-splittable $\mathbb{Z}$-colorable Link Is Four

K. Ichihara and E. Matsudo introduced the notions of $\mathbb{Z}$-colorable links and the minimal coloring number for $\mathbb{Z}$-colorable links, which is one of invariants for links. They proved that the lower bound of minimal coloring number of a non-splittable $\mathbb{Z}$-colorable link is 4. In this paper, we show the minimal coloring number of any non-splittable $\mathbb{Z}$-colorable link is exactly 4.

2017-06-11math.ATmath.GT

Coloring links by the symmetric group of degree three

We consider the number of colors for the colorings of links by the symmetric group $S_3$ of degree $3$. For knots, such a coloring corresponds to a Fox 3-coloring, and thus the number of colors must be 1 or 3. However, for links, there are colorings by $S_3$ with 4 or 5 colors. In this paper, we show that if a 2-bridge link admits a coloring by $S_3$ with 5 colors, then the link also admits such a coloring with only 4 colors.

2022-10-04math.GT

The Gordian distance of handlebody-knots and Alexander biquandle colorings

We give lower bounds for the Gordian distance and the unknotting number of handlebody-knots by using Alexander biquandle colorings. We construct handlebody-knots with Gordian distance $n$ and unknotting number $n$ for any positive integer $n$.

2017-04-25math.GT

一般环面链环的二面体广群着色广群图

Quandle Coloring Quivers of general Torus links by dihedral quandles

本研究通过先穷尽着色数再分析着色间关联的方法，完整刻画了一般环面链环的二面体广群着色广群图，明确了其含完全子图且结构随着色数变化的特性。

2024-03-07math.COmath.GTmath.QA

平面图中偶多边形面的半单色着色

The half-monochromatic colorings of plane graphs with even polygonal faces

本文研究了平面图中偶多边形面的半单色着色问题，给出了基于独立数的着色颜色数上界。

2026-02-23math.COmath.GT

An Improvement of the lower bound for the minimum number of link colorings by quandles

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, 2018). We express this lower bound in terms of the degree k of the reduced Alexander polynomial of the considered knot. We show that it is exactly k + 1 for L-space knots. Then we apply these results to torus knots and Pretzel knots P(-2,3,2l + 1), l>=0. We note that this lower bound can be attained for some particular knots. Furthermore, we show that Theorem…

2022-10-12math.GT

Quandle Colorings of Knots and Applications

We present a set of 26 finite quandles that distinguish (up to reversal and mirror image) by number of colorings, all of the 2977 prime oriented knots with up to 12 crossings. We also show that 1058 of these knots can be distinguished from their mirror images by the number of colorings by quandles from a certain set of 23 finite quandles. We study the colorings of these 2977 knots by all of the 431 connected quandles of order at most 35 found by L. Vendramin. Among other things, we collect information about quandles that have the same number of colorings for all of the 2977 knots. For example,…

2014-01-08math.GT

允许着色的不变量与结环的4相函数

Coloring-allowed Invariants and the 4-phases Functions of Knotoids

School of Mathematical Sciences, Dalian University of Technology（大连理工大学数学科学学院）

本文引入平面结环的允许着色不变量，基于着色数定义，并详细讨论4相函数的性质与不变性。

2026-06-09math.GT

曲面链环的桥数与 kei 着色

The bridge number of surface links and kei colorings

本文利用 kei 着色建立曲面链环桥数的下界，证明对每个整数 $n\geq4$ 都存在无穷多个桥数恰为 $n$ 的曲面纽结。

2020-12-31math.GT

Knot Colorings: Coloring and Goeritz matrices

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 colorings, and how these can be computed from either the coloring matrix or the Goeritz matrix. We give an elementary approach to this equivalence, without using any algebraic topology. We also compute knot determinant, nullity of pretzel knots with arbitrarily many twist regions.

2019-10-17math.GT

Pretzel链环的Quandle着色拟阵

Quandle coloring quivers of pretzel links

本文系统研究pretzel链环的二面体quandle着色及着色拟阵，确定3-pretzel情形，并在n为素数时给出4-pretzel及一般m-pretzel链环的着色数和拟阵结构，附完整证明。

2026-09-25math.ATmath.GT