A New Bijection Between Forests and Parking Functions
Reviewed by Pithpith:DJCJTWAUopen to challenge →
classification
math.CO
keywords
functionsparkingbijectionforestsanswersbijectiveby-productconstruct
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.