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

Source: [The complexity of the $q$-analog of the $n$-cube](<https://www.sota2.com/research/paper/68fa4f6d1e209131ce96362c>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-27T04:50:53.684Z

Authors: Murali K. Srinivasan

Published: 2011-11-08T04:41:07.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1111.1799>)

[PDF](<https://arxiv.org/pdf/1111.1799.pdf>)
