English

Some aspects of (r,k)-parking functions

Combinatorics 2018-05-18 v2

Abstract

An \emph{(r,k)(r,k)-parking function} of length nn may be defined as a sequence (a1,,an)(a_1,\dots,a_n) of positive integers whose increasing rearrangement b1bnb_1\leq\cdots\leq b_n satisfies bik+(i1)rb_i\leq k+(i-1)r. The case r=k=1r=k=1 corresponds to ordinary parking functions. We develop numerous properties of (r,k)(r,k)-parking functions. In particular, if Fn(r,k)F_n^{(r,k)} denotes the Frobenius characteristic of the action of the symmetric group Sn\mathfrak{S}_n on the set of all (r,k)(r,k)-parking functions of length nn, then we find a combinatorial interpretation of the coefficients of the power series (n0Fn(r,1)tn)k\left( \sum_{n\geq 0}F_n^{(r,1)}t^n\right)^k for any kZk\in \mathbb{Z}. When k>0k>0, this power series is just n0Fn(r,k)tn\sum_{n\geq 0} F_n^{(r,k)} t^n; when k<0k<0, we obtain a dual to (r,k)(r,k)-parking functions. We also give a qq-analogue of this result. For fixed rr, we can use the symmetric functions Fn(r,1)F_n^{(r,1)} to define a multiplicative basis for the ring Λ\Lambda of symmetric functions. We investigate some of the properties of this basis.

Keywords

Cite

@article{arxiv.1604.07897,
  title  = {Some aspects of (r,k)-parking functions},
  author = {Richard Stanley and Yinghui Wang},
  journal= {arXiv preprint arXiv:1604.07897},
  year   = {2018}
}