Critical groups of simplicial complexes
From MaRDI portal
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.
Recommendations
Cites work
- A finite group attached to the laplacian of a graph
- Arithmetical graphs
- Cellular spanning trees and laplacians of cubical complexes
- Chip-firing and the critical group of a graph
- Chip-firing games on graphs
- Combinatorial Laplacian of the matching complex
- Combinatorial Laplacians of matroid complexes
- Combinatorics and commutative algebra.
- Critical groups for complete multipartite graphs and Cartesian products of complete graphs
- Enumerating bases of self-dual matroids
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- Harmonic functions and boundary value problems on a chain complex
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3678793 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1027930 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 5790250 (Why is no real title available?)
- Linear systems on tropical curves
- On the Betti numbers of chessboard complexes
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Self-organized critical state of sandpile automaton models
- Shifted simplicial complexes are Laplacian integral
- Simplical Geometry and Transportation Polytopes
- Simplicial matrix-tree theorems
- The critical group of a threshold graph
- The critical groups of a family of graphs and elliptic curves over finite fields
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
- Unimodular equivalence of graphs
Cited in
(25)- Flow-firing processes
- A family of matrix-tree multijections
- Eigenvalues and critical groups of Adinkras
- Simplicial dollar game
- Cuts and flows of cell complexes
- On the critical ideals of graphs
- The magnetic discrete Laplacian inferred from the Gauß-Bonnet operator and application
- A combinatorial mapping for the higher-dimensional matrix-tree theorem
- Chip firing on general invertible matrices
- Abelian networks. III: The critical group
- Simplicial and cellular trees
- Critical groups of simplicial complexes
- Algebraic properties of generalized graph Laplacians: resistor networks, critical groups, and homological algebra
- Links in surfaces and Laplacian modules
- Fundamental groups of simplicial complexes
- Reviews
- Critical groups for iterated maps
- Cuts and flows of cell complexes
- Weighted spectra on a weighted geometric realization of 2-simplexes and 3-simplexes
- On discrete gradient vector fields and Laplacians of simplicial complexes
- A three-regime theorem for flow-firing
- Smith normal form in combinatorics
- Tropical complexes
- Networks beyond pairwise interactions: structure and dynamics
- Critical groups for homeomorphism classes of graphs
This page was built for publication: Critical groups of simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950424)
