A LIMITATION ON ALGORITHMS FOR CONSTRUCTING MINIMAL ARC-PRESENTATIONS FROM LINK DIAGRAMS-Reference-Cited by-同舟云学术

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

A LIMITATION ON ALGORITHMS FOR CONSTRUCTING MINIMAL ARC-PRESENTATIONS FROM LINK DIAGRAMS

Published:1998-06 Issue:04 Volume:07 Page:415-423
ISSN:0218-2165
Container-title:Journal of Knot Theory and Its Ramifications
language:en
Short-container-title:J. Knot Theory Ramifications

Author:

BELTRAMI ELISABETTA¹,CROMWELL PETER R.²

Affiliation:

1. Dipartimento di Matematica, Università di Pisa, Via F. Buonarroti 2, 56127 Pisa, Italy

2. Department of Pure Mathematics, University of Liverpool, PO Box 147, Liverpool, L69 3BX, England

Abstract

The arc index of a link is closely related to its crossing number. An algorithm is known which produces an arc-presentation by drawing the binding circle on a link diagram. When the algorithm can be applied and the link is alternating, the presentation is known to be minimal. Here we exhibit an example which shows that no such algorithm can be valid for all link diagrams.

Publisher

World Scientific Pub Co Pte Lt

Subject

Algebra and Number Theory

Link

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

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

1. ARC INDEX OF NON-ALTERNATING LINKS;Journal of Knot Theory and Its Ramifications;2002-05

2. An upper bound of arc index of links;Mathematical Proceedings of the Cambridge Philosophical Society;2000-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP