A New Matrix-Tree Theorem
组合数学
2007-05-23 v2 几何拓扑
量子代数
摘要
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 exactly three vertices) the spanning trees are generated by the Pfaffian of a suitably defined matrix. This result can be interpreted topologically as an expression for the lowest order term of the Alexander-Conway polynomial of an algebraically split link. We also prove some algebraic properties of our Pfaffian-tree polynomial.
引用
@article{arxiv.math/0109104,
title = {A New Matrix-Tree Theorem},
author = {Gregor Masbaum and Arkady Vaintrob},
journal= {arXiv preprint arXiv:math/0109104},
year = {2007}
}
备注
minor changes, 29 pages, version accepted for publication in Int. Math. Res. Notices