Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Enumeration and Quasipolynomiality of Chip-Firing Configurations   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.

21
The categories of this paper are: adap-org
23
The categories of this paper are: solv-int
20
The categories of this paper are: acc-phys
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
35
The categories of this paper are: mtrl-th
11
The categories of this paper are: hep-lat
30
The categories of this paper are: q-alg
12
The categories of this paper are: nucl-th
18
The categories of this paper are: econ
25
The categories of this paper are: patt-sol
9
The categories of this paper are: nlin
14
The categories of this paper are: math-ph
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio