Year: 2025
Type: article
Abstract: We use an infinite k-ary tree with a self-loop at the root as our underlying graph.We consider a chip-firing process starting with N chips at the root.We describe the stable configurations.We calculate the number of fires for each vertex and the total number of fires.We study a sequence of the number of root fires for a given k as a function of N and study its properties.We do the same for the total number of fires.
Authors: Dillan Agrawal, Selena Ge, Jate Greene, Dohun Kim, Rajarshi Mandal, Tanish Parida, Anirudh Pulugurtha, Gordon Redwine, Soham Samanta, Albert Xu, Tanya Khovanova
Institution: Massachusetts Institute of Technology
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7117991983
FWCI:
Cites:
Cited by:
Related to: