Descents in Parking Functions
Paul R. F. Schumacher
1512 Oakview Street
Bryan, TX 77802
USA
Abstract:
Parking functions are a superset of permutations. In this article, we
count the number of parking functions of length n with a fixed number
of ties, as well as the number of descents in those parking functions.
The steps to achieve this result also reveal many things about their
internal structure.
Full version: pdf,
dvi,
ps,
latex
(Concerned with sequence
A001263.)
Received November 15 2017; revised versions received February 24 2018; February 26 2018;
March 2 2018.
Published in Journal of Integer Sequences, March 3 2018.
Return to
Journal of Integer Sequences home page
