A New Bijection Between Forests and Parking Functions
From MaRDI portal
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 page was built for publication: A New Bijection Between Forests and Parking Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6211094)
