Some Enumerations for Parking Functions

Details Some Enumerations for Parking Functions Some Enumerations for Parking Functions

2008-06-03

arxiv.org/abs/0806.0424v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Some Enumerations for Parking Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some Enumerations for Parking Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Enumerations for Parking Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-194752