Directed rooted forests in higher dimension (Q504966)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6675970
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Directed rooted forests in higher dimension |
scientific article; zbMATH DE number 6675970 |
Statements
Directed rooted forests in higher dimension (English)
0 references
18 January 2017
0 references
Summary: For a graph \(G\), the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of arbitrary dimension. This requires generalizing the notion of rooted forest to higher dimension. We also introduce orientations of higher dimensional rooted trees and forests. These orientations are discrete vector fields which lead to open questions concerning expressing homological quantities combinatorially.
0 references
simplicial complexes
0 references
matrix-tree theorem
0 references
0.8998335
0 references
0 references
0 references
0.87146056
0 references
0.8626774
0 references
0.86119616
0 references
0.85986716
0 references
0.8580791
0 references
0.8568934
0 references
