1 paper
Sam Armon, Joanne Beckford, Dillon Hanson +4
Classical parking functions are a generalization of permutations that appear in many combinatorial structures. Prime parking functions are indecomposable components such that any c…