The number of Prime Parking Functions

2023/02/08 by Duarte, Rui, de Oliveira, António Guedes · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2302.04210

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.

Cited by

• Prime graphical parking functions and strongly recurrent configurations of the Abelian sandpile model

Related

• Primeness of generalized parking functions
• On the primes in floor function sets
• The Prime Number Theorem and Primorial Numbers
• A Simple Proof Of The Prime Number Theorem
• A prime prime primer