THE LENGTH OF SHORT WORDS IN UNAVOIDABLE SETS-Reference-Cited by-同舟云学术

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

THE LENGTH OF SHORT WORDS IN UNAVOIDABLE SETS

Published:2011-09 Issue:06 Volume:21 Page:951-960
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

HIGGINS PETER M.¹

Affiliation:

1. Department of Mathematical Sciences, University of Essex, Colchester, UK CO4 3SQ, UK

Abstract

Maximum possible lengths of short words in unavoidable sets of order no more than n have the form log n + O( log log n). The respective log bases of the upper and lower bounds of the shortest and second shortest words are (for a two-letter alphabet) 2 and τ, the Golden Ratio. The latter result comes through identifying certain bases of free monoids.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

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

Reference5 articles.

1. UNAVOIDABLE SETS OF CONSTANT LENGTH

2. On extendibility of unavoidable sets

3. Algebraic Combinatorics on Words

4. Unavoidable languages, cuts and innocent sets of words

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

1. Creating and Using Minimizer Sketches in Computational Genomics;Journal of Computational Biology;2023-12-01

2. Unavoidable Sets of Partial Words of Uniform Length;Electronic Proceedings in Theoretical Computer Science;2017-08-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP