AbstractWe prove two generalizations of the matrix-tree theorem. The first one, a result essentially due to Moon for which we provide a new proof, extends the “all minors” matrix-tree theorem to the “massive” case where no condition on row or column sums is imposed. The second generalization, which is new, extends the recently discovered Pfaffian-tree theorem of Masbaum and Vaintrob into a “hyper-Pfaffian-cactus” theorem. Our methods are noninductive, explicit and make critical use of the Grassmann–Berezin calculus that was developed for the needs of modern theoretical physics
AbstractThe Matrix-Tree Theorem is a well-known combinatorial result relating the value of the minor...
AbstractA new form of multivariable Lagrange inversion is given, with determinants occurring on both...
The pfaffian is a classical tool which can be regarded as a generalization of the determinant. The h...
AbstractWe prove two generalizations of the matrix-tree theorem. The first one, a result essentially...
23 pages, 2 figures, 3 references addedWe prove two generalizations of the matrix-tree theorem. The ...
International audienceIn this short note, we revisit Zeilberger's proof of the classical matrix-tree...
AbstractThe Matrix-Tree Theorem is a well-known combinatorial result relating the value of the minor...
ABSTRACT. The All Minors Matrix Tree Theorem states that the determinant of any sub-matrix of a matr...
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in ...
A half-tree is an edge configuration whose superimposition with a perfect match-ing is a tree. In th...
34 pages, 10 figuresA half-tree is an edge configuration whose superimposition with a perfect matchi...
International audienceThe ‘All Minors Matrix Tree Theorem’ (Chen, Applied Graph Theory, Graphs and E...
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given gr...
In this short note, we revisit Zeilberger's proof of the classical matrix-tree theorem and give a un...
AbstractThe power of Grassmann algebra techniques is demonstrated by proving a theorem on Pfaffians ...
AbstractThe Matrix-Tree Theorem is a well-known combinatorial result relating the value of the minor...
AbstractA new form of multivariable Lagrange inversion is given, with determinants occurring on both...
The pfaffian is a classical tool which can be regarded as a generalization of the determinant. The h...
AbstractWe prove two generalizations of the matrix-tree theorem. The first one, a result essentially...
23 pages, 2 figures, 3 references addedWe prove two generalizations of the matrix-tree theorem. The ...
International audienceIn this short note, we revisit Zeilberger's proof of the classical matrix-tree...
AbstractThe Matrix-Tree Theorem is a well-known combinatorial result relating the value of the minor...
ABSTRACT. The All Minors Matrix Tree Theorem states that the determinant of any sub-matrix of a matr...
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in ...
A half-tree is an edge configuration whose superimposition with a perfect match-ing is a tree. In th...
34 pages, 10 figuresA half-tree is an edge configuration whose superimposition with a perfect matchi...
International audienceThe ‘All Minors Matrix Tree Theorem’ (Chen, Applied Graph Theory, Graphs and E...
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given gr...
In this short note, we revisit Zeilberger's proof of the classical matrix-tree theorem and give a un...
AbstractThe power of Grassmann algebra techniques is demonstrated by proving a theorem on Pfaffians ...
AbstractThe Matrix-Tree Theorem is a well-known combinatorial result relating the value of the minor...
AbstractA new form of multivariable Lagrange inversion is given, with determinants occurring on both...
The pfaffian is a classical tool which can be regarded as a generalization of the determinant. The h...