Pseudodeterminants and perfect square spanning tree counts
Abstract
The pseudodeterminant of a square matrix is the last nonzero coefficient in its characteristic polynomial; for a nonsingular matrix, this is just the determinant. If is a symmetric or skew-symmetric matrix then . Whenever is the boundary map of a self-dual CW-complex , this linear-algebraic identity implies that the torsion-weighted generating function for cellular -trees in is a perfect square. In the case that is an \emph{antipodally} self-dual CW-sphere of odd dimension, the pseudodeterminant of its th cellular boundary map can be interpreted directly as a torsion-weighted generating function both for -trees and for -trees, complementing the analogous result for even-dimensional spheres given by the second author. The argument relies on the topological fact that any self-dual even-dimensional CW-ball can be oriented so that its middle boundary map is skew-symmetric.
Keywords
Cite
@article{arxiv.1311.6686,
title = {Pseudodeterminants and perfect square spanning tree counts},
author = {Jeremy L. Martin and Molly Maxwell and Victor Reiner and Scott O. Wilson},
journal= {arXiv preprint arXiv:1311.6686},
year = {2015}
}
Comments
Final version; minor revisions. To appear in Journal of Combinatorics