The complexity of the q-analog of the n-cube
classification
🧮 math.CO
keywords
analogcomplexitycubeactionalgebrablockbooleancombinatorial
read the original 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,F_q)$ action on the $q$-analog of the Boolean algebra.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.