最小充分色集与最小色数
Minimal sufficient sets of colors and minimum number of colors
摘要:
本文首先研究了p=11和p = 13的极小充分色集。对于奇素数p和任意行列式为非零的p-可着色链L,给出了mincol_p L \geq 5(p \geq 11)和mincol_p L \geq 6(p \geq 17)的另一种证明.我们阐述了等价类的集合不同的颜色(在一个给定的模数),并证明有两个这样的类的五个颜色模11,只有一个这样的类的五个颜色模13。最后,我们给出了一个肯定的回答中村,中西,和佐藤提出的一个问题,涉及交叉数的不等式。我们证明,它是一个平等的只有三叶形和8字结。
英文摘要:
In this paper we first investigate minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with non-zero determinant, we give alternative proofs of mincol_p L \geq 5 for p \geq 11 and mincol_p L \geq 6 for p \geq 17. We elaborate on equivalence classes of sets of distinct colors (on a given modulus) and prove that there are two such classes of five colors modulo 11, and only one such class of five colors modulo 13. Finally, we give a positive answer to a question raised by Nakamura, Nakanishi, and Satoh concerning an inequality involving crossing numbers. We show it is an equality only for the trefoil and for the figure-eight knots.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。