English

On linear $n$-colorings for knots

Geometric Topology 2012-02-29 v2

Abstract

If a knot has the Alexander polynomial not equal to 1, then it is linear nn-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot is quandle colorable. For twist knots, we study the minimal quandle orders in detail.

Keywords

Cite

@article{arxiv.1110.3952,
  title  = {On linear $n$-colorings for knots},
  author = {Chuichiro Hayashi and Miwa Hayashi and Kanako Oshiro},
  journal= {arXiv preprint arXiv:1110.3952},
  year   = {2012}
}

Comments

14pages, 4 figures

R2 v1 2026-06-21T19:22:02.726Z