A combinatorial mapping for the higher-dimensional matrix-tree theorem
zbMATH Open1504.52016MaRDI QIDQ2680943FDOQ2680943
Authors: Alex McDonough
Publication date: 5 January 2023
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://www.mat.univie.ac.at/~slc/wpapers/FPSAC2021/62.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of groups and algebras (05E16)
Cites Work
- Computing the Continuous Discretely
- Self-organized criticality
- Enumerating degree sequences in digraphs and a cycle--cocycle reversing system
- Chip-Firing and Rotor-Routing on Directed Graphs
- Critical groups of simplicial complexes
- Simplicial matrix-tree theorems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings
- Matrix tree theorems
- Cuts and flows of cell complexes
- Circuit-cocircuit reversing systems in regular matroids
- GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY
- A family of matrix-tree multijections
- Algebraic Properties of Generalized Graph Laplacians: Resistor Networks, Critical Groups, and Homological Algebra
Cited In (2)
This page was built for publication: A combinatorial mapping for the higher-dimensional matrix-tree theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680943)