Coloring links by the symmetric group of degree three
Kazuhiro Ichihara, Eri Matsudo

TL;DR
This paper investigates the coloring of links using the symmetric group S_3, revealing that certain 5-colorings in 2-bridge links can be reduced to 4-colorings, expanding understanding of link colorings.
Contribution
It demonstrates that for 2-bridge links, 5-colorings by S_3 can always be reduced to 4-colorings, providing new insights into link coloring properties.
Findings
2-bridge links with 5-colorings also admit 4-colorings
Colorings by S_3 differ between knots and links
The number of colors in link colorings can be reduced under certain conditions
Abstract
We consider the number of colors for the colorings of links by the symmetric group of degree . 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 with 4 or 5 colors. In this paper, we show that if a 2-bridge link admits a coloring by with 5 colors, then the link also admits such a coloring with only 4 colors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Homotopy and Cohomology in Algebraic Topology · Finite Group Theory Research
