Gončarov polynomials and parking functions
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
For given positive integers a and b, an [a,b]-parking function of length n is a sequence (x"1,x"2,...,x"n) of positive integers whose order statistics x"("i") (the sequence obtained by rearranging the original sequence in non-decreasing order) satisfy the inequalities x"("i")=