English

Pseudodeterminants and perfect square spanning tree counts

Combinatorics 2015-01-07 v2

Abstract

The pseudodeterminant pdet(M)\textrm{pdet}(M) of a square matrix is the last nonzero coefficient in its characteristic polynomial; for a nonsingular matrix, this is just the determinant. If \partial is a symmetric or skew-symmetric matrix then pdet(t)=pdet()2\textrm{pdet}(\partial\partial^t)=\textrm{pdet}(\partial)^2. Whenever \partial is the kthk^{th} boundary map of a self-dual CW-complex XX, this linear-algebraic identity implies that the torsion-weighted generating function for cellular kk-trees in XX is a perfect square. In the case that XX is an \emph{antipodally} self-dual CW-sphere of odd dimension, the pseudodeterminant of its kkth cellular boundary map can be interpreted directly as a torsion-weighted generating function both for kk-trees and for (k1)(k-1)-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

R2 v1 2026-06-22T02:15:10.696Z