Counting the palstars

Abstract: A palstar (after Knuth, Morris, and Pratt) is a concatenation of even-length palindromes. We show that, asymptotically, there are

T h e t a (a l p h a_{k}^{n})

palstars of length

2 n

over a

k

-letter alphabet, where

a l p h a_{k}

is a constant such that

2 k - 1 < a l p h a_{k} < 2 k - 1 o v e r 2

. In particular,

a l p h a_{2} d o t e q 3.33513193

.

Full work available at URL: https://arxiv.org/abs/1311.2318

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

Cites Work

Cited In (7)

This page was built for publication: Counting the palstars