Skip to Main content Skip to Navigation
Conference papers

Critical Groups of Simplicial Complexes

Abstract : 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.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01215108
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, October 13, 2015 - 3:06:57 PM
Last modification on : Thursday, August 22, 2019 - 4:26:01 PM
Long-term archiving on: : Thursday, April 27, 2017 - 12:28:04 AM

File

dmAO0125.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01215108, version 1

Collections

Citation

Art M. Duval, Caroline J. Klivans, Jeremy L. Martin. Critical Groups of Simplicial Complexes. 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.269-280. ⟨hal-01215108⟩

Share

Metrics

Record views

204

Files downloads

903