An improvement of the lower bound for the minimum number of link colorings by quandles

DOI10.1142/s021821652350044xzbMath1522.57004arXiv2210.06530OpenAlexW4377140976MaRDI QIDQ6174724

Hamid Abchir, Soukaina Lamsifer

Publication date: 17 August 2023

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.06530

zbMATH Keywords

knotslinksquandle coloring

Mathematics Subject Classification ID

Knot polynomials (57K14) Knot theory (57K10) Generalized knots (virtual knots, welded knots, quandles, etc.) (57K12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pretzel knots with \(L\)-space surgeries
• Fox coloring and the minimum number of colors
• The minimum number of Fox colors modulo 13 is 5
• 5-colored knot diagram with four colors
• A proof of the Kauffman-Harary conjecture
• Colorings beyond Fox: the other linear Alexander quandles
• Concordance homomorphisms from knot Floer homology
• On knot Floer homology and lens space surgeries
• 11-Colored knot diagram with five colors
• Basic Modern Algebra with Applications
• COLORING LINK DIAGRAMS BY ALEXANDER QUANDLES
• A lower bound on minimal number of colors for links
• On the Braid Index of Alternating Links
• The Lehmer Polynomial and Pretzel Links
• On the minimum number of Fox Colorings of Knots
• The minimum number of coloring of knots
• On effective 9-colorings for knots
• Minimal sufficient sets of colors and minimum number of colors
• Any 7-colorable knot can be colored by four colors

This page was built for publication: An improvement of the lower bound for the minimum number of link colorings by quandles