Research Repository

The length of short words in unavoidable sets

Higgins, PM (2011) 'The length of short words in unavoidable sets.' International Journal of Algebra and Computation, 21 (6). 951 - 960. ISSN 0218-1967

Full text not available from this repository.

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. © 2011 World Scientific Publishing Company.

Item Type: Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: Jim Jamieson
Date Deposited: 12 Feb 2013 13:08
Last Modified: 23 Jan 2019 00:17
URI: http://repository.essex.ac.uk/id/eprint/5513

Actions (login required)

View Item View Item