Minimal coloring number for Z-colorable links. II
From MaRDI portal
Publication:5223022
DOI10.1142/S0218216519500470zbMATH Open1419.57018arXiv1705.07567OpenAlexW4237954964MaRDI QIDQ5223022FDOQ5223022
Authors: Eri Matsudo
Publication date: 4 July 2019
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Abstract: The minimal coloring number of a -colorable link is the minimal number of colors for non-trivial -colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable -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 -colorable except for the case of 2 parallels with non-zero linking number. We then give a simple way to obtain a diagram which attains the minimal coloring number for such even parallels of links.
Full work available at URL: https://arxiv.org/abs/1705.07567
Recommendations
Cites Work
Cited In (8)
- Minimal coloring numbers on minimal diagrams of torus links
- Title not available (Why is that?)
- Minimal coloring number for ℤ-colorable links
- MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES
- The minimal coloring number of any non-splittable \(\mathbb Z\)-colorable link is four
- Clifford links are the only minimizers of the zone modulus among non-split links
- The 10-palette number of links
- The 6- and 8-palette numbers of links
This page was built for publication: Minimal coloring number for \(\mathbb{Z}\)-colorable links. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223022)