Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Some aspects of (r,k)-parking functions (1604.07897v2)

Published 27 Apr 2016 in math.CO

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

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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