150 citations · 427 across the 22 of their papers we have counts for
22 papers
Palindromes in starlike trees
Amy Glen, Jamie Simpson, W. F. Smyth
In this note, we obtain an upper bound on the maximum number of distinct non-empty palindromes in starlike trees. This bound implies, in particular, that there are at most dis…
More properties of the Fibonacci word on an infinite alphabet
Amy Glen, Jamie Simpson, W. F. Smyth
Recently the Fibonacci word on an infinite alphabet was introduced by [Zhang et al., Electronic J. Combinatorics 24-2 (2017) #P2.52] as a fixed point of the morphism $ϕ: (2i) \…
Counting Lyndon factors
Amy Glen, Jamie Simpson, W. F. Smyth
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length can contain. We also derive formulas for the expected total number of Lyndon fac…
Generalized trapezoidal words
Amy Glen, Florence Levé
The factor complexity function of a finite or infinite word counts the number of distinct factors of of length for each . A finite word of length…
The total run length of a word
Amy Glen, Jamie Simpson
A run in a word is a periodic factor whose length is at least twice its period and which cannot be extended to the left or right (by a letter) to a factor with greater period. In r…
Extremal properties of (epi)Sturmian sequences and distribution modulo 1
Jean-Paul Allouche, Amy Glen
Starting from a study of Y. Bugeaud and A. Dubickas (2005) on a question in distribution of real numbers modulo 1 via combinatorics on words, we survey some combinatorial propertie…