2015/04/27 by Bergeron, Francois
#05A15 #05A19 #05E05 #05E10 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1504.07136
We enumerate interlaced pairs of parking functions whose underlying Dyck path has a bounded height. We obtain an explicit formula for this enumeration in the form of a quotient of analogs of Chebicheff polynomials having coefficients in the ring of symmetric functions.