The classical matrix-tree theorem discovered by Kirchhoff in 1847 expresses the principal minor of the \(n \times n\) Laplace matrix as a sum of monomials of matrix elements indexed by directed trees with n vertices. We prove, for any \(k \ge n\), a three-parameter family of identities between degree k polynomials of matrix elements of the Laplace matrix. For \(k=n\) and special values of the parameters, the identity turns to be the matrix-tree theorem. For the same values of parameters and arbitrary \(k \ge n\), the left-hand side of the identity becomes a specific polynomial of the matrix elements called higher determinant of the matrix. We study properties of the higher determinants; in particular, they have an application (due to M. Polyak) in the topology of 3-manifolds.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Awan, J., Bernardi, O.: Tutte polynomials for directed graphs. arXiv:1610.01839v2
Burman, Yu., Ploskonosov, A., Trofimova, A.: Matrix-tree theorems and discrete path integration. Linear Algebra Appl. 466, 64–82 (2015)
Chaiken, S.: A combinatorial proof of the all minors matrix tree theorem. SIAM J. Discrete Math. 3(3), 319–329 (1982)
Epstein, B.: A combinatorial invariant of \(3\)-manifolds via cycle-rooted trees. MSc. thesis (under supervision of prof. M. Polyak), Technion, Haifa, Israel (2015)
Kirchhoff, G.: Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme gefurht wird. Ann. Phys. Chem. 72, 497–508 (1847)
Polyak, M.: From \(3\)-manifolds to planar graphs and cycle-rooted trees, talk at Arnold’s legacy conference. Fields Institute, Toronto (2014)
Rota, G.-C.: On the foundations of combinatorial theory I: theory of Möbius functions. Z. Wahrsch. Verw. Gebiete 2, 340–368 (1964)
Sokal, A.: The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In: Webb, B.S. (ed.) Surveys in combinatorics 2005. London Mathematical Society Lecture Note Series, vol. 327, pp. 173–226. Cambridge University Press, Cambridge (2005)
Tutte, W.T.: The dissection of equilateral triangles into equilateral triangles. Math. Proc. Cambridge Philos. Soc. 44(4), 463–482 (1948)
Walker, K.: An Extension of Casson’s Invariant, Annals of Mathematics Studies, 126. Princeton University Press, Princeton (1992)
Welsh, D.J.A., Merino, C.: The Potts model and the Tutte polynomial. J. Math. Phys. 41(3), 1127–1152 (2000)
The research was inspired by numerous discussions with prof. Michael Polyak (Haifa Technion, Israel) whom the author wishes to express his most sincere gratitude.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The research was funded by the Russian Academic Excellence Project ‘5-100’ and by the Simons-IUM fellowship 2017 by the Simons Foundation.
About this article
Cite this article
Burman, Y. Higher matrix-tree theorems and Bernardi polynomial. J Algebr Comb 50, 427–446 (2019). https://doi.org/10.1007/s10801-018-0863-x
- Matrix-tree theorem
- Directed graph
- Tutte polynomial
Mathematics Subject Classification