A Gaussian binomial coefficient identity

Let uu and ii be nonnegative integers and let qq be a prime power. Write (nr)q\binom{n}{r}_{q} for the Gaussian binomial coefficient, namely the number of rr-dimensional subspaces of Fqn\mathbb{F}_{q}^{n}. Gaussian binomial identity.

(ui)q2j=0iqj(ij)q2=(ui)qj=0i1(1+quj).\binom{u}{i}_{q^2}\sum_{j=0}^i q^{j}\binom{i}{j}_{q^2}=\binom{u}{i}_{q}\prod_{j=0}^{i-1}(1+q^{u-j}).

This identity arises in the study of Gaussian binomial coefficients and is stated here without a resolution; its validity is relevant to the paper's enumeration of linearized Reed–Solomon codes.

Sources & referencesView supporting material

Primary source

Haode Yan and Chunlei Liu, “Linearized Reed-Solomon codes and linearized Wenger graphs”, arXiv:1502.01885 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.