2 citations · 5 across the 8 of their papers we have counts for
8 papers
Counting Subwords in Circular Words and Their Parikh Matrices
Ghajendran Poovanandran, Jamie Simpson, Wen Chean Teh
The word inference problem is to determine languages such that the information on the number of occurrences of those subwords in the language can uniquely identify a word. A consid…
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…
Solved and unsolved problems about abelian squares
Jamie Simpson
We present and discuss a number of known results and open problems abelian squares in words on small alphabets.
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) \…
A different approach to the Fraenkel Conjecture for low values
Ofir Schnabel, Jamie Simpson
We present a new approach to deal with Fraenkel's conjecture, which describes how the integers can be partitioned into sets of rational Beatty sequences, in the case where the nume…
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…