11-Colored knot diagram with five colors

Author:

Nakamura T.1,Nakanishi Y.2,Satoh S.2

Affiliation:

1. Department of Engineering Science, Osaka Electro-Communication University, Hatsu-cho 18-8, Neyagawa 572-8530, Japan

2. Department of Mathematics, Kobe University, Rokkodai-cho 1-1, Nada-ku, Kobe 657-8501, Japan

Abstract

We prove that any 11-colorable knot is presented by an 11-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially 11-colored diagrams of the knot. We also prove a similar result for any 11-colorable ribbon 2-knot.

Publisher

World Scientific Pub Co Pte Lt

Subject

Algebra and Number Theory

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. An improvement of the lower bound for the minimum number of link colorings by quandles;Journal of Knot Theory and Its Ramifications;2023-06

2. The minimum number of coloring of knots;Journal of Knot Theory and Its Ramifications;2022-02

3. Removing colors 2k, 2k − 1, and k;Journal of Knot Theory and Its Ramifications;2019-11

4. Minimal sufficient sets of colors and minimum number of colors;Journal of Knot Theory and Its Ramifications;2017-08

5. The palette numbers of 2-bridge knots;Journal of Knot Theory and Its Ramifications;2017-04-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3