Simplicial and cellular trees
From MaRDI portal
cell complexcombinatorial Laplaciancritical groupforestmatrix-tree theoremmatroidsimplicial complexspanning treetree
Combinatorial aspects of matroids and geometric lattices (05B35) Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of simplicial complexes (05E45) Simplicial sets and complexes in algebraic topology (55U10) Relations of low-dimensional topology with graph theory (57M15)
Abstract: Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed first by Bolker, Kalai and Adin, and more recently by numerous authors, the fundamental topological properties of a tree --- namely acyclicity and connectedness --- can be generalized to arbitrary dimension as the vanishing of certain cellular homology groups. This point of view is consistent with the matroid-theoretic approach to graphs, and yields higher-dimensional analogues of classical enumerative results including Cayley's formula and the matrix-tree theorem. A subtlety of the higher-dimensional case is that enumeration must account for the possibility of torsion homology in trees, which is always trivial for graphs. Cellular trees are the starting point for further high-dimensional extensions of concepts from algebraic graph theory including the critical group, cut and flow spaces, and discrete dynamical systems such as the abelian sandpile model.
Recommendations
Cited in
(29)- A higher-dimensional homologically persistent skeleton
- Increasing spanning forests in graphs and simplicial complexes
- A higher Boltzmann distribution
- Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
- Exact periodic wave solutions for the modified Zakharov equations with a quantum correction
- Products of arithmetic matroids and quasipolynomial invariants of CW-complexes
- A colourful path to matrix-tree theorems
- Simplicial dollar game
- High-dimensional networks and spanning forests
- The theta number of simplicial complexes
- The generalization of the formula V(G)=E(G)+1 for simplicial trees
- Simplicial structures and transverse cellularity
- A combinatorial mapping for the higher-dimensional matrix-tree theorem
- Simplicial matrix-tree theorems
- A simple model of trees for unicellular maps
- Logarithmic tree-numbers for acyclic complexes
- Cohen-Lenstra heuristics for torsion in homology of random complexes
- Canonical sphere bases for simplicial and cubical complexes
- On the topology of no k-equal spaces
- On discrete gradient vector fields and Laplacians of simplicial complexes
- Euler's theorem for regular CW-complexes
- Partitions of vertices and facets in trees and stacked simplicial complexes
- Simplex links in determinantal hypertrees
- Torsion-weighted spanning acycle entropy in cubical lattices and Mahler measures
- Simplicial effective resistance and enumeration of spanning trees
- Hopf monoids of ordered simplicial complexes
- A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes
- Period matrices and homological quasi-trees on discrete Riemann surfaces
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
This page was built for publication: Simplicial and cellular trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957200)
