1 citations · 1 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2021
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…
math.CO2018
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…
math.CO2018
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.