Removing colors 2k, 2k − 1, and k-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Removing colors 2k, 2k − 1, and k

Published:2019-11 Issue:13 Volume:28 Page:1940013
ISSN:0218-2165
Container-title:Journal of Knot Theory and Its Ramifications
language:en
Short-container-title:J. Knot Theory Ramifications

Author:

Lopes Pedro¹

Affiliation:

1. Department of Mathematics, Center for Mathematical Analysis, Geometry, and Dynamical Systems, Instituto Superior Técnico, Universidade de Lisboa, Av. Rovisco Pais, 1049-001 Lisbon, Portugal

Abstract

This article concerns Fox colorings. We prove that if a link admits non-trivial [Formula: see text]-colorings, with prime [Formula: see text], it also admits non-trivial [Formula: see text]-colorings not involving colors [Formula: see text], nor [Formula: see text].

Funder

FCT/Portugal

Publisher

World Scientific Pub Co Pte Lt

Subject

Algebra and Number Theory

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218216519400133

Reference12 articles.

1. The minimum number of Fox colors modulo 13 is 5

2. Any 11-Colorable knot can be colored with at most six colors

3. Knots and Graphs I—Arc Graphs and Colorings

4. ON THE MAXIMUM NUMBER OF COLORS FOR LINKS

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

1. Knots with Composite Colors;The College Mathematics Journal;2024-01-09

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP