Heesung Shin
Published 2008-10-02, updated 2008-10-03Version 2
In 1980, G. Kreweras gave a recursive bijection between forests and parking functions. In this paper we construct a nonrecursive bijection from forests onto parking functions, which answers a question raised by R. Stanley. As a by-product, we obtain a bijective proof of Gessel and Seo's formula for lucky statistic on parking functions.
A note on the log-concavity of parking functions
Results on pattern avoidance in parking functions
Trees, Parking Functions and Factorizations of Full Cycles
![QR code for arXiv:0810.0427 [math.CO]](http://oss.arxitics.com/images/favicon.svg)