The complexity of the $q$-analog of the $n$-cube

Murali K. Srinivasan

We present a positive, combinatorial, good formula for the complexity (= number of spanning trees) of the $q$-analog of the $n$-cube. Our method also yields the explicit block diag…