A New Bijection Between Forests and Parking Functions
Combinatorics
2008-10-03 v2
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.
Cite
@article{arxiv.0810.0427,
title = {A New Bijection Between Forests and Parking Functions},
author = {Heesung Shin},
journal= {arXiv preprint arXiv:0810.0427},
year = {2008}
}
Comments
11 pages