arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.1334math.GT
收藏

小素数的最小Fox色数

Minimum Number of Fox Colors for Small Primes

P. Lopes, J. Matias

摘要:

本文给出了行列式为非空的环的模r上的Fox染色的最少颜色数的精确结果。具体地说,我们证明了,每当最小的素除子的行列式,这样的链接和模r是2,3,5,或7,那么最小的颜色数是2,3,4,或4(分别),反之亦然。因此,我们推测,对于每个素数p,存在唯一的正整数m,具有以下性质。对于任意非空行列式的链L和任意模r,使得p是L的行列式和模r的最小素除子,L模r的最小颜色数为m。

英文摘要:

This article concerns exact results on the minimum number of colors of a Fox coloring over the integers modulo r, of a link with non-null determinant. Specifically, we prove that whenever the least prime divisor of the determinant of such a link and the modulus r is 2, 3, 5, or 7, then the minimum number of colors is 2, 3, 4, or 4 (respectively) and conversely. We are thus led to conjecture that for each prime p there exists a unique positive integer, m, with the following property. For any link L of non-null determinant and any modulus r such that p is the least prime divisor of the determinant of L and the modulus r, the minimum number of colors of L modulo r is m.

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

↑