Coloring links by the symmetric group of degree three
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
We consider the number of colors for 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.
Abstract
We consider the number of colors for 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.
참고문헌 (7)
- R. H. Crowell, "Introduction to Knot Theory, Graduate Texts in Mathematics, No. 57" (1977), Springer
- L. H. Kauffman, "Determinants of rational knots", Discrete Math. Theor. Comput. Sci, 11(2), pp.111~122 (2009)
- A. Kawauchi, "A Survey of Knot Theory" (1996), Birkh¨auser Verlag
- E. Matsudo, "Minimal coloring number for Z-colorable links II", J. Knot Theory Ramifications, 28(7), pp.1950047~1950053 (2019)[DOI]
- K. Murasugi, "Knot Theory and Its Applications" (1996), Birkh¨auser Boston, Inc
- S. Satoh, "5-colored knot diagram with four colors", Osaka J. Math, 46(4), pp.939~948 (2009)[DOI]
- M. Zhang, "The minimal coloring number of any non-splittable Z-colorable link is four", J. Knot Theory Ramifications, 26(13), pp.1750084~1750101 (2017)[DOI]