Critical groups of arithmetical structures under a generalized star-clique operation
From MaRDI portal
Publication:2093519
Abstract: An arithmetical structure on a finite, connected graph without loops is given by an assignment of positive integers to the vertices such that, at each vertex, the integer there is a divisor of the sum of the integers at adjacent vertices, counted with multiplicity if the graph is not simple. Associated to each arithmetical structure is a finite abelian group known as its critical group. Keyes and Reiter gave an operation that takes in an arithmetical structure on a finite, connected graph without loops and produces an arithmetical structure on a graph with one fewer vertex. We study how this operation transforms critical groups. We bound the order and the invariant factors of the resulting critical group in terms of the original arithmetical structure and critical group. When the original graph is simple, we determine the resulting critical group exactly.
Recommendations
Cites work
- Arithmetical graphs
- Arithmetical structures on bidents
- Arithmetical structures on graphs
- Arithmetical structures on paths with a doubled edge
- Bounding the number of arithmetical structures on graphs
- Chip-firing games and critical groups
- Chiò's and Dodgson's determinantal identities
- Counting arithmetical structures on paths and cycles
- Divisors and sandpiles. An introduction to chip-firing
- scientific article; zbMATH DE number 1380572 (Why is no real title available?)
- scientific article; zbMATH DE number 3221233 (Why is no real title available?)
- Smith normal form and Laplacians
- Smith normal form in combinatorics
- The mathematics of chip-firing
- Various proofs of Sylvester's (determinant) identity.
Cited in
(4)
This page was built for publication: Critical groups of arithmetical structures under a generalized star-clique operation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093519)