Art M. Duval ; Caroline J. Klivans ; Jeremy L. Martin - Critical Groups of Simplicial Complexes

dmtcs:2909 - Discrete Mathematics & Theoretical Computer Science, January 1, 2011, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) - https://doi.org/10.46298/dmtcs.2909
Critical Groups of Simplicial Complexes

Authors: Art M. Duval ; Caroline J. Klivans ; Jeremy L. Martin ORCID-iD

    We generalize the theory of critical groups from graphs to simplicial complexes. Specifically, given a simplicial complex, we define a family of abelian groups in terms of combinatorial Laplacian operators, generalizing the construction of the critical group of a graph. We show how to realize these critical groups explicitly as cokernels of reduced Laplacians, and prove that they are finite, with orders given by weighted enumerators of simplicial spanning trees. We describe how the critical groups of a complex represent flow along its faces, and sketch another potential interpretation as analogues of Chow groups.


    Volume: DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
    Section: Proceedings
    Published on: January 1, 2011
    Imported on: January 31, 2017
    Keywords: graph,simplicial complex,critical group,combinatorial Laplacian,chip-firing game,sandpile model,spanning trees,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

    Linked data

    Source : ScholeXplorer IsReferencedBy ARXIV 1308.3813
    Source : ScholeXplorer IsReferencedBy DOI 10.1007/s00229-019-01148-3
    Source : ScholeXplorer IsReferencedBy DOI 10.48550/arxiv.1308.3813
    • 1308.3813
    • 10.48550/arxiv.1308.3813
    • 10.1007/s00229-019-01148-3
    • 10.1007/s00229-019-01148-3
    • 10.1007/s00229-019-01148-3
    Tropical complexes
    Cartwright, Dustin ;

    Share

    Consultation statistics

    This page has been seen 194 times.
    This article's PDF has been downloaded 277 times.