Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/22156

Title: On the density of Lyndon roots in factors
Authors: Crochemore, Maxime
Mercas, Robert
Issue Date: 2016
Publisher: © Elsevier
Citation: CROCHEMORE, M. and MERCAS, R., 2016. On the density of Lyndon roots in factors. Theoretical Computer Science, 656 (B), pp. 234–240.
Abstract: This work takes another look at the number of runs that a string may contain and provides an alternative proof for the bound. We also propose another stronger conjecture that states the following: for a fixed order on the alphabet, within every factor of a word there are at most as many occurrences of Lyndon roots corresponding to runs in the word as the length of the factor. Only first occurrences of roots in each run are considered.
Version: Submitted for publication
DOI: 10.1016/j.tcs.2016.02.015
URI: https://dspace.lboro.ac.uk/2134/22156
Publisher Link: http://dx.doi.org/10.1016/j.tcs.2016.02.015
ISSN: 0304-3975
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
1412.4646v3.pdfSubmitted version146.52 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.