On the sandpile group of dual graphs (Q1568782): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4353479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organized criticality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing and the critical group of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organized critical state of sandpile automaton models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic aspects of Abelian sandpile models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings of acyclic and parking functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parking functions and noncrossing partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank

Latest revision as of 15:54, 29 May 2024

scientific article
Language Label Description Also known as
English
On the sandpile group of dual graphs
scientific article

    Statements

    On the sandpile group of dual graphs (English)
    0 references
    0 references
    0 references
    28 August 2000
    0 references
    \textit{E. Goles} studied the notion of sandpile group in [Sand piles, combinatorial games and cellular automata. Instabilities and nonequilibrium structures III. Math. Appl., 64, 101-121 (1991)]. Let \(G= (X,E)\) be a (nondirected) finite connected graph without loops. The elements of \({\mathcal Z}^n\) (i.e., the vectors of length \(n\) whose components are integers) form an abelian group. By the sandpile group \(\text{SP}(G)\) of \(G\), a factor group of \({\mathcal Z}^n\) is meant (where \(n=|X|\)) with respect to a subgroup defined by means of the adjacency matrix of \(G\). It is shown that \(\text{SP}(G)\) and \(\text{SP}(G^*)\) are isomorphic if \(G\) is a planar graph and \(G^*\) is its dual, and that to every finite abelian group \({\mathfrak G}\) there is a planar graph \(G\) such that \(\text{SP}(G)\) is isomorphic to \({\mathfrak G}\). The sandpile groups \(\text{SP}(K_n)\) are explicitly determined (\(K_n\) is the complete graph on \(n\) vertices). Let \(v\) be a cut vertex of \(G\). Denote by \(G_i\) the subgraph induced by \(X_i\cup \{v\}\) where \(X_i\) is one of the vertex classes (split by \(v\)). It is stated that \(\text{SP}(G)\) is the direct product of all the groups \(\text{SP}(G_i)\). The authors consider models formerly also discussed by \textit{D. Dhar} [Phys. Rev. Lett. 64, No. 14, 1613-1616 (1990)].
    0 references
    dual graphs
    0 references
    sandpile group
    0 references
    planar graph
    0 references

    Identifiers