31 research outputs found
A family of bijections between G-parking functions and spanning trees
For a directed graph G on vertices {0,1,...,n}, a G-parking function is an
n-tuple (b_1,...,b_n) of non-negative integers such that, for every non-empty
subset U of {1,...,n}, there exists a vertex j in U for which there are more
than b_j edges going from j to G-U. We construct a family of bijective maps
between the set P_G of G-parking functions and the set T_G of spanning trees of
G rooted at 0, thus providing a combinatorial proof of |P_G| = |T_G|.Comment: 11 pages, 4 figures; a family of bijections containing the two
original bijections is presented; submitted to J. Combinatorial Theory,
Series
Monomization of Power Ideals and Parking Functions
In this note, we find a monomization of a certain power ideal associated to a
directed graph. This power ideal has been studied in several settings. The
combinatorial method described here extends earlier work of other, and will
work on several other types of power ideals, as will appear in later work
A Bijection Between the Recurrent Configurations of a Hereditary Chip-Firing Model and Spanning Trees
Hereditary chip-firing models generalize the Abelian sandpile model and the
cluster firing model to an exponential family of games induced by covers of the
vertex set. This generalization retains some desirable properties, e.g.
stabilization is independent of firings chosen and each chip-firing equivalence
class contains a unique recurrent configuration. In this paper we present an
explicit bijection between the recurrent configurations of a hereditary
chip-firing model on a graph and its spanning trees.Comment: 13 page
Parking functions on toppling matrices
Let be an integer -matrix which satisfies the
conditions: , and
there exists a vector such that . Here the notation means that for all , and
means that for every . Let
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 -parking functions. It is shown that the
number of -parking functions is less than or equal to the determinant
of . 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 -recurrent
configurations. It is obtained that the number of -recurrent
configurations is larger than or equal to the determinant of . A simple
bijection from -parking functions to -recurrent configurations
is established. It follows from this bijection that the number of
-parking functions and the number of -recurrent configurations
are both equal to the determinant of