1412.4646v3.pdf (146.52 kB)

On the density of Lyndon roots in factors

Download (146.52 kB)
journal contribution
posted on 01.08.2016, 15:40 by Maxime Crochemore, Robert 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.

History

School

  • Science

Department

  • Computer Science

Published in

Theoretical Computer Science

Citation

CROCHEMORE, M. and MERCAS, R., 2016. On the density of Lyndon roots in factors. Theoretical Computer Science, 656 (B), pp. 234–240.

Publisher

© Elsevier

Version

SMUR (Submitted Manuscript Under Review)

Publisher statement

This 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/

Publication date

2016

ISSN

0304-3975

Language

en

Exports

Logo branding

Keywords

Exports