The complexity of the q-analog of the n-cube
Abstract
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,Fq) action on the q-analog of the Boolean algebra.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.