On discrete gradient vector fields and Laplacians of simplicial complexes
DOI10.1007/s00026-023-00655-1arXiv2105.05388OpenAlexW3161487140MaRDI QIDQ6192066
No author found.
Publication date: 11 March 2024
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.05388
simplicial complexesmatchingsdiscrete Laplacianspectral graph theorydiscrete Morse theoryrooted forestsdiscrete gradient vector fields
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Critical points and critical submanifolds in differential topology (57R70) Combinatorial aspects of simplicial complexes (05E45) Discrete Morse theory and related ideas in manifold topology (57Q70)
Cites Work
- Unnamed Item
- Unnamed Item
- Discrete Morse theory for computing cellular sheaf cohomology
- Directed rooted forests in higher dimension
- Random geometric complexes
- Characterizing equivalent discrete Morse functions
- A note on the pure Morse complex of a graph
- Morse theory for cell complexes
- A user's guide to discrete Morse theory
- On the topology of rooted forests in higher dimensions
- Structural theory and classification of 2D Adinkras
- Chip-firing games, potential theory on graphs, and spanning trees
- Progress in algebraic combinatorics. Based on the international symposium on algebraic combinatorics, Fukuoka, Japan, 1993 and the research project on algebraic combinatorics, Kyoto, Japan, April 1994 -- March 1995
- Critical groups of simplicial complexes
- The graph Laplacian and Morse inequalities
- Discrete Morse theory for free chain complexes
- Complexes of discrete Morse functions
- Simplicial and cellular trees
- Combinatorial Laplacians of matroid complexes
- Discrete Morse functions from lexicographic orders
- On the rooted forests in triangulated closed manifolds
- Discrete Morse Theory
- Morse Theory
- Computing Optimal Morse Matchings
This page was built for publication: On discrete gradient vector fields and Laplacians of simplicial complexes
