Enumeration and Quasipolynomiality of Chip-Firing Configurations

Details Enumeration and Quasipolynomiality of Chip-Firing Configurations Enumeration and Quasipolynomiality of Chip-Firing Configurations

2011-04-02

arxiv.org/abs/1104.0279v1

Mathematics

Combinatorics

16 pages

Scientific paper

In this paper we explore enumeration problems related to the number of reachable configurations in a chip-firing game on a finite connected graph G. We define an auxiliary notion of debt-reachability and prove that the number of debt-reachable configurations from an initial configuration with c chips on one vertex is a quasipolynomial in c. For the cycle graph C_n, we apply these results to compute a near explicit formula for the number of debt-reachable configurations. We then derive polynomial asymptotic bounds for the number of debt-reachable and reachable configurations, and finally provide evidence for a quasipolynomiality conjecture regarding the number of reachable configurations.

Affiliated with

Also associated with

No associations

Rating

Enumeration and Quasipolynomiality of Chip-Firing Configurations 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 Enumeration and Quasipolynomiality of Chip-Firing Configurations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration and Quasipolynomiality of Chip-Firing Configurations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334667