Article

Some Enumerations for Parking Functions

07/2008;
Source: arXiv

ABSTRACT In this paper, let $\mathcal{P}_{n,n+k;\leq n+k}$ (resp. $\mathcal{P}_{n;\leq s}$) denote the set of parking functions $\alpha=(a_1,...,a_n)$ of length $n$ with $n+k$ (respe. $n$)parking spaces satisfying $1\leq a_i\leq n+k$ (resp. $1\leq a_i\leq s$) for all $i$. Let $p_{n,n+k;\leq n+k}=|\mathcal{P}_{n,n+k;\leq n+k}|$ and $p_{n;\leq s}=|\mathcal{P}_{n;\leq s}|$. Let $\mathcal{P}_{n;\leq s}^l$ denote the set of parking functions $\alpha=(a_1,...,a_n)\in\mathcal{P}_{n;\leq s}$ such that $a_1=l$ and $p_{n;\leq s}^l=|\mathcal{P}_{n;\leq s}^l|$. We derive some formulas and recurrence relations for the sequences $p_{n,n+k;\leq n+k}$, $p_{n;\leq s}$ and $p_{n;\leq s}^l$ and give the generating functions for these sequences. We also study the asymptotic behavior for these sequences.

0 Bookmarks
 · 
75 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, let $\mathcal{P}_{n;\leq s;k}^l$ denote a set of $k$-flaw preference sets $(a_1,...,a_n)$ with $n$ parking spaces satisfying that $1\leq a_i\leq s$ for any $i$ and $a_1=l$ and $p_{n;\leq s;k}^l=|\mathcal{P}_{n;\leq s;k}^l|$. We use a combinatorial approach to the enumeration of $k$-flaw preference sets by their leading terms. The approach relies on bijections between the $k$-flaw preference sets and labeled rooted forests. Some bijective results between certain sets of $k$-flaw preference sets of distinct leading terms are also given. We derive some formulas and recurrence relations for the sequences $p_{n;\leq s;k}^l$ and give the generating functions for these sequences.
    07/2008;

Full-text

Download
0 Downloads
Available from