On the density of Lyndon roots in factors
journal contributionposted on 2016-08-01, 15:40 authored by Maxime Crochemore, Robert MercasRobert Mercas
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.
- Computer Science
Published inTheoretical Computer Science
CitationCROCHEMORE, M. and MERCAS, R., 2016. On the density of Lyndon roots in factors. Theoretical Computer Science, 656 (B), pp. 234–240.
- SMUR (Submitted Manuscript Under Review)
Publisher statementThis work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/