Saved in:
Bibliographic Details
Main Authors: Reiner, Victor, Smith, Dorian
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2402.15453
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929480269824000
author Reiner, Victor
Smith, Dorian
author_facet Reiner, Victor
Smith, Dorian
contents Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex to a tree. For example, it is shown that the number of generators of the sandpile group is at most one less than the number of leaves in the tree. For trees on a fixed number of vertices, the paths and stars are shown to provide extreme behavior, not only for the number of generators, but also for the number of spanning trees, and for Tutte polynomial evaluations that count the recurrent sandpile configurations by their numbers of chips.
format Preprint
id arxiv_https___arxiv_org_abs_2402_15453
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Sandpile groups for cones over trees
Reiner, Victor
Smith, Dorian
Combinatorics
05C50, 05C25
Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex to a tree. For example, it is shown that the number of generators of the sandpile group is at most one less than the number of leaves in the tree. For trees on a fixed number of vertices, the paths and stars are shown to provide extreme behavior, not only for the number of generators, but also for the number of spanning trees, and for Tutte polynomial evaluations that count the recurrent sandpile configurations by their numbers of chips.
title Sandpile groups for cones over trees
topic Combinatorics
05C50, 05C25
url https://arxiv.org/abs/2402.15453