Back to search

University of Minnesota

Sandpile Groups for Cones Over Trees

Abstract

dc:description.abstract

The sandpile group of a connected graph G is a finite abelian group whose cardinality is the number of spanning trees in the graph. We investigate how the "shape" of the graph G relates to the structure of its sandpile group K(G), including the cardinality (G) = |K(G)|, the minimal number of generators μ(G) for K(G) the sandpile group, and the Tutte polynomial evaluation TG (1,). To this end we study sandpile groups for graphs Cone(T) obtained by attaching a cone vertex to a tree T. We also answer one of the questions posed by Reiner and Smith by exhibiting a family of trees Tₙ whose number of leaves grows without bound, but for which the sandpile groups K(Cone(Tₙ)) are all cyclic.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Smith, Dorian Ayana

Subjects

dc:subject × 6

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Citation
Smith, Dorian Ayana. (2026). Sandpile Groups for Cones Over Trees. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/283152.

Chain of custody

source
Harvested from
University of Minnesota
Base URL
conservancy.umn.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Smith, Dorian Ayana. Sandpile Groups for Cones Over Trees. 2026. https://hdl.handle.net/11299/283152