2000 character limit reached
The number of Prime Parking Functions
Published 8 Feb 2023 in math.CO | (2302.04210v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.