A New Bijection Between Forests and Parking Functions

Simple item page
dc.creatorShin, Heesung
dc.date2008-10-02
dc.date2008-10-03
dc.date.accessioned2026-07-07T10:07:06Z
dc.date.available2026-07-07T10:07:06Z
dc.descriptionIn 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.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/0810.0427
dc.identifierhttp://arxiv.org/abs/0810.0427
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/170518
dc.subjectCombinatorics
dc.subject05A15
dc.titleA New Bijection Between Forests and Parking Functions
dc.typetext

Files

Collections

arXiv