The complexity of the $q$-analog of the $n$-cube
  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 diagonalization of the commutant of the $GL(n,F_q)$ action on the $q$-analog of the Boolean algebra. 
Murali K. Srinivasan
math.CO