Simplicial matrix-tree theorems
By Art M. Duval, Caroline J. Klivans, Jeremy L. Martin. 2008
123 citations recorded by the source corpus.
First published in Transactions of the American Mathematical Society in volume 361 (2009), no. 11, 6073--6114, published by the American Mathematical Society
Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics
View Paper: https://www.semanticscholar.org/paper/d1ad8250e0570a5839ec229860367239122de9f7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
In Computational Theory and Mathematics
- Danijela Horak
- Russell Lyons
- Matthew Kahle
- Jürgen Jost
- Michael Farber
- Armindo Costa
- Michael T. Schaub
- Robert J. Adler
In Discrete Mathematics and Combinatorics
- Russell Lyons
- Matthew Kahle
- Subhro Ghosh
- Alexei Borodin
- Charles Bordenave
- Pietro Caputo
- Tim Austin
- Rémi Bardenet
Citations in the corpus
- Random Complexes and l^2-Betti Numbers (2008, methodology): “An extension of Kalai’s result to general simplicial complexes was given by Duval, Klivans, and Martin (2008); an extension in a different direction was given by Adin (1992).”
- Spectra of combinatorial Laplace operators on simplicial complexes (2011, background): “Many subsequent papers then studied properties of the higher order combinatorial Laplacian (see [9],[14],[10]), building upon properties of the graph Laplacian.”
- Topology of random simplicial complexes: a survey (2013, background): “In closely related enumerative work, Duval, Klivans, and Martin extended Kalai’s result, generalizing the Matrix Tree Theorem to higher dimensions [18].”