Conference presentation
On the number of palindromically rich words
59th Annual Meeting of the Australian Mathematical Society (Flinders University, Adelaide, 28/09/2015–01/10/2015)
2015
Abstract
Rich words (also known as full words ) are a special family of finite and infinite words characterised by containing the maximal number of distinct palindromes. We prove that the number of rich words of length n over a finite alphabet A (consisting of 3 or more letters) grows at least polynomially with the size of A. We also show asymptotic exponential growth for the number of rich words of length 2n over a 2-letter alphabet. Moreover, we discuss possible factor complexity functions of rich words and consider the difficult (open) problem of enumerating the finite rich words over a fixed finite alphabet.
Details
- Title
- On the number of palindromically rich words
- Authors/Creators
- A. Glen (Author/Creator)
- Conference
- 59th Annual Meeting of the Australian Mathematical Society (Flinders University, Adelaide, 28/09/2015–01/10/2015)
- Identifiers
- 991005543905807891
- Murdoch Affiliation
- School of Engineering and Information Technology
- Language
- English
- Resource Type
- Conference presentation
Metrics
60 File views/ downloads
29 Record Views