Counting the palstars (Q405318): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q405317 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:11, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting the palstars |
scientific article |
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
