المساق
arXiv 2017-05-22 0 مشاهدة

Minimal coloring number for Z-colorable links II

Matsudo, Eri

الأصل · EN

The minimal coloring number of a Z-colorable link is the minimal number of colors for non-trivial Z-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable Z-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 Z-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.

الترجمة العربية

لا توجد ترجمة عربية لهذا البحث بعد. كن أوّل من يطلبها: تستغرق ثوانيَ معدودة، وتُحفظ النتيجة لكل قارئ قادم.

تحقّق أمني

اكتب الأحرف الظاهرة أعلاه

حتى 10 ترجمات لكل شخص يومياً.