Three-Element Lucky Sets of Stirling Permutations
Version 1 / Oct 18, 2026 / CC BY 4.0
Abstract
We characterize the three-element sets of lucky car indices that occur when a Stirling permutation of order is used as a parking function. A set , with , is admissible precisely when is odd, or is even and is odd with , or both are even with . Explicit Stirling words realize every permitted case. The number of admissible sets is , where . This answers the three-element characterization and enumeration question in Problem 46 of Colmenarejo et al. The complete classification, parking constructions, and enumeration have been checked in Lean. HAL deposit: hal-05800210v1.
References
- L. Colmenarejo, A. Dawkins, J. Elder, P. E. Harris, K. J. Harry, S. Kara, D. Smith, and B. E. Tenner, On the lucky and displacement statistics of Stirling permutations , J. Integer Sequences 27 (2024), Article 24.6.7. https://cs.uwaterloo.ca/journals/JIS/VOL27/Tenner/tenner12.pdf.link