# Sum of Gaussian binomial coefficients.

We all know that $\sum_{i=0}^{n}{n \choose i}=2^{n}$. Is there a similar result regarding the q-binomial coefficients? (a.k.a Gaussian binomial coefficients) - $\sum_{i=0}^{n}{n \choose i}_{q}=?$

-
I think that you need to define your normalizations before stating the question. What is your definition of $[n]_q?$ –  Scott Carter Mar 1 '12 at 7:54

The identity $\prod_{i=0}^{n-1} (1+xq^i) = \sum_{k=0}^n x^k q^{{k\choose 2}}{n\choose k}_q$ is the $q$-binomial theorem. A combinatorial proof based on integer partitions is mentioned on page 68 of Enumerative Combinatorics, vol. 1, 2nd ed. There is also given a combinatorial proof based on finite fields. For the online version at http://math.mit.edu/~rstan/ec/ec1.pdf, see pages 74-75.

-
There are many possibilities, e.g. $\sum_{i=0}^{n}q^i{n \choose i}_{q^2}=(1+q)(1+q^2)...(1+q^n)$
$\sum_{i=0}^{n}q^{i(i+1)/2}{n \choose i}_{q }=(1+q)(1+q^2)...(1+q^n).$
That's interesting. Do you know a bijective proof of these identities, based on the fact that the Gaussian binomial coefficient is the number of subspaces of dimension $i$ in $(\mathbb{Z}/q)^n$? –  Neil Strickland Mar 1 '12 at 10:38