Related papers: A colourful path to matrix-tree theorems
A very short proof of the Fej\'er-Riesz lemma is presented in the matrix case
A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.
This paper is a continuation of arXiv:1612.03873. We prove a three-parameter family of identities (Theorem 1.1) involving a version of the Tutte polynomial for directed graphs introduced by Awan and Bernardi in arXiv:1610.01839. A…
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…
A new very simple proof of the number of labeled rooted forest-graphs with a given number of vertices is given. As a partial case of this formula we have Cayley's formula.
The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…
In this note, simple proofs of certain well-known results involving the positive square root of positive matrices are given.
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…
In this note, we use the isomorphism of the ring of $G$-circulant matrices over a field $k$ with the group ring $k[G]$ to derive a very short proof of the Classical Maschke Theorem.
We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
We determine the Newton trees of the rational polynomials of simple type, thus filling a gap in the proof of the classification of these polynomials given by Neumann and Norbury.
The classical matrix-tree theorem discovered by G.Kirchhoff in 1847 relates the principal minor of the nxn Laplace matrix to a particular sum of monomials of matrix elements indexed by directed trees with n vertices and a single sink. In…
By the classical Sturm's theorem, the number of distinct real roots of a given real polynomial $f(x)$ within any interval $(a,b]$ can be expressed by the number of variations in the sign of the Sturm chain at the bounds. Through…
Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs. We introduce symbolic skew-adjacency matrices and reduction…
Following suggestions of T. H. Koornwinder, we give a new proof of Kummer's theorem involving Zeilberger's algorithm, the WZ method and asymptotic estimates. In the first section, we recall a classical proof given by L. J. Slater. The…
In the early 1980s, Mills, Robbins and Rumsey conjectured, and in 1996 Zeilberger proved a simple product formula for the number of $n \times n$ alternating sign matrices with a 1 at the top of the $i$-th column. We give an alternative…
We prove a general theorem that gives a linear recurrence for tuples of paths in every cylindrical network. This can be seen as a cylindrical analog of the Lindstr\"om-Gessel-Viennot theorem. We illustrate the result by applying it to Schur…