Mathematics – Combinatorics
Scientific paper
2007-01-13
Mathematics
Combinatorics
8 pages
Scientific paper
We answer a question of Laszlo Babai concerning the abelian sandpile model. Given a graph, the model yields a finite abelian group of recurrent configurations which is closely related to the combinatorial Laplacian of the graph. We explicitly describe the group elements and operations in the case of thick trees with loops--that is, graphs which are obtained from trees by setting arbitrary edge multiplicities and adding loops at vertices. We do this both concretely (by describing the so-called recurrent and identity configurations) and abstractly (by computing the group's abstract structure), and define maps identifying the two.
Chen William
Schedler Travis
No associations
LandOfFree
Concrete and abstract structure of the sandpile group for thick trees with loops 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 Concrete and abstract structure of the sandpile group for thick trees with loops, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concrete and abstract structure of the sandpile group for thick trees with loops will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-122152