Journal article
Palindromes in starlike trees
Australasian Journal of Combinatorics, Vol.73(1), pp.242-246
2019
Abstract
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 4 n distinct non-empty palindromes in a starlike tree with three branches each of length n. For such starlike trees labelled with a binary alphabet, we sharpen the upper bound to 4 n − 1 and conjecture that the actual maximum is 4 n − 2. It is intriguing that this simple conjecture seems difficult to prove, in contrast to the proof of the bound.
Details
- Title
- Palindromes in starlike trees
- Authors/Creators
- A. Glen (Author/Creator)J. Simpson (Author/Creator)W.F. Smyth (Author/Creator)
- Publication Details
- Australasian Journal of Combinatorics, Vol.73(1), pp.242-246
- Publisher
- Combinatorial Mathematics Society of Australasia
- Identifiers
- 991005544946607891
- Copyright
- © 2019 The author(s).
- Murdoch Affiliation
- School of Engineering and Information Technology
- Language
- English
- Resource Type
- Journal article
Metrics
21 File views/ downloads
41 Record Views