“…Despite the simplicity of its definition, Lyndon words have many deep and interesting combinatorial properties [36] and have been applied to a wide range of problems [36,43,35,15,5,19,34,4,27,41,18]. Lyndon words have recently been considered in the context of runs [12,13], since any run with period p must contain a length-p substring that is a Lyndon word, called an L-root of the run. Concerning the number of cubic runs (runs with exponent at least 3), Crochemore et al [12] gave a very simple proof that it can be no more than 0.5n.…”