Papers
Topics
Authors
Recent
Search
2000 character limit reached

Some aspects of (r,k)-parking functions

Published 27 Apr 2016 in math.CO | (1604.07897v2)

Abstract: An \emph{$(r,k)$-parking function} of length $n$ may be defined as a sequence $(a_1,\dots,a_n)$ of positive integers whose increasing rearrangement $b_1\leq\cdots\leq b_n$ satisfies $b_i\leq k+(i-1)r$. The case $r=k=1$ corresponds to ordinary parking functions. We develop numerous properties of $(r,k)$-parking functions. In particular, if $F_n{(r,k)}$ denotes the Frobenius characteristic of the action of the symmetric group $\mathfrak{S}n$ on the set of all $(r,k)$-parking functions of length $n$, then we find a combinatorial interpretation of the coefficients of the power series $\left( \sum{n\geq 0}F_n{(r,1)}tn\right)k$ for any $k\in \mathbb{Z}$. When $k>0$, this power series is just $\sum_{n\geq 0} F_n{(r,k)} tn$; when $k<0$, we obtain a dual to $(r,k)$-parking functions. We also give a $q$-analogue of this result. For fixed $r$, we can use the symmetric functions $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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.