On the entropy and letter frequencies of powerfree words
classification
🧮 math.CO
keywords
wordsbinaryboundscubefreeentropyfrequenciesletterpowerfree
read the original abstract
We review the recent progress in the investigation of powerfree words, with particular emphasis on binary cubefree and ternary squarefree words. Besides various bounds on the entropy, we provide bounds on letter frequencies and consider their empirical distribution obtained by an enumeration of binary cubefree words up to length 80.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.