Counting the palstars (Q405318)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting the palstars |
scientific article; zbMATH DE number 6340249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting the palstars |
scientific article; zbMATH DE number 6340249 |
Statements
Counting the palstars (English)
0 references
4 September 2014
0 references
Summary: A palstar is a concatenation of even-length palindromes. We show that, asymptotically, there are \(\Theta(\alpha_k^n)\) palstars of length \(2n\) over a \(k\)-letter alphabet, where \(\alpha_k\) is a constant such that \(2k-1 \alpha_k 2k-{1 \over 2}\). In particular, \(\alpha_2\doteq 3.33513193\).
0 references
palindrome
0 references
palstar
0 references
prime palstar
0 references
bordered word
0 references
analytic combinatorics
0 references
0 references
0 references
0 references
