Parking functions on toppling matrices

Abstract: Let

D e l t a

be an integer

n i m e s n

-matrix which satisfies the conditions:

d e t D e l t a e q 0

,

D e l t a_{i j} l e q 0 e x t f o r i e q j,

and there exists a vector

such that

. Here the notation

means that

r_{i} > 0

for all

i

, and

means that

r_{i} g e q r'_{i}

for every

i

. Let

m a t h s c r R (D e l t a)

be the set of vectors

such that

and

. In this paper,

-parking functions are defined for any

. It is proved that the set of

-parking functions is independent of

for any

. For this reason,

-parking functions are simply called

D e l t a

-parking functions. It is shown that the number of

D e l t a

-parking functions is less than or equal to the determinant of

D e l t a

. Moreover, the definition of

-recurrent configurations are given for any

. It is proved that the set of

-recurrent configurations is independent of

for any

. Hence,

-recurrent configurations are simply called

D e l t a

-recurrent configurations. It is obtained that the number of

D e l t a

-recurrent configurations is larger than or equal to the determinant of

D e l t a

. A simple bijection from

D e l t a

-parking functions to

D e l t a

-recurrent configurations is established. It follows from this bijection that the number of

D e l t a

-parking functions and the number of

D e l t a

-recurrent configurations are both equal to the determinant of

D e l t a

.

This page was built for publication: Parking functions on toppling matrices