Some Enumerations for Parking Functions

Abstract: In this paper, let

m a t h c a l P_{n, n + k; l e q n + k}

(resp.

m a t h c a l P_{n; l e q s}

) denote the set of parking functions

a l p h a = (a_{1}, ..., a_{n})

of length

n

with

n + k

(respe.

n

)parking spaces satisfying

1 l e q a_{i} l e q n + k

(resp.

1 l e q a_{i} l e q s

) for all

i

. Let

p_{n, n + k; l e q n + k} = | m a t h c a l P_{n, n + k; l e q n + k} |

and

p_{n; l e q s} = | m a t h c a l P_{n; l e q s} |

. Let

m a t h c a l P_{n; l e q s}^{l}

denote the set of parking functions

a l p h a = (a_{1}, ..., a_{n}) i n m a t h c a l P_{n; l e q s}

such that

a_{1} = l

and

p_{n; l e q s}^{l} = | m a t h c a l P_{n; l e q s}^{l} |

. We derive some formulas and recurrence relations for the sequences

p_{n, n + k; l e q n + k}

,

p_{n; l e q s}

and

p_{n; l e q s}^{l}

and give the generating functions for these sequences. We also study the asymptotic behavior for these sequences.

This page was built for publication: Some Enumerations for Parking Functions