The number of Prime Parking Functions

MaRDI QIDQ6425867zbMATH OpenFDO

Authors Rui Duarte, António Guedes de Oliveira

Publication date 8 February 2023

Abstract: A parking function of length $n$ is prime if we obtain a parking function of length $n-1$ by deleting one 1 from it. In this note we give a new direct proof that the number of prime parking functions of length $n$ is $(n-1{)}^{n-1}$. This proof leads to a new interpretation, in close terms to the definition of parking function.

This page was built for publication: The number of Prime Parking Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425867)