The complexity of the $q$-analog of the $n$-cube
Combinatorics
2011-11-15 v2
Abstract
We present a positive, combinatorial, good formula for the complexity (= number of spanning trees) of the -analog of the -cube. Our method also yields the explicit block diagonalization of the commutant of the action on the -analog of the Boolean algebra.
Keywords
Cite
@article{arxiv.1111.1799,
title = {The complexity of the $q$-analog of the $n$-cube},
author = {Murali K. Srinivasan},
journal= {arXiv preprint arXiv:1111.1799},
year = {2011}
}
Comments
12 pages. This paper is a revised and expanded version of part of the author's previous paper " Counting spanning trees of the hypercube and its $q$-analogs by explicit block diagonalization" (arXiv:1104.1481), to which a reference has been added