Gaussian binomial
From Wikipedia, the free encyclopedia
In mathematics, the Gaussian binomials (sometimes called the Gaussian coefficients, or the q-binomial coefficients) are the q-analogs of the binomial coefficients.
The Gaussian binomials are defined by
One can prove that
The Pascal identities for the Gaussian binomials are
and
The Newton binomial formulas are
and
Like the ordinary binomial coefficients, the Gaussian binomials are center-symmetric i.e. invariant under the reflection :
The first Pascal identity allows one to compute the Gaussian binomials recursively (with respect to m ) using the initial "boundary" values
and also incidentally shows that the Gaussian binomials are indeed polynomials (in q). The second Pascal identity follows from the first using the substitution and the invariance of the Gaussian binomials under the reflection . Both Pascal identities together imply
which leads (when applied iteratively for m, m − 1, m − 2,....) to an expression for the Gaussian binomial as given in the definition above.
[edit] Applications
Gaussian binomials occur in the counting of symmetric polynomials and in the theory of partitions. They also play an important role in the enumerative theory of symmetric spaces defined over a finite field. In particular, for every finite field Fq with q elements, the Gaussian binomial
counts the number vn,k;q of different k-dimensional vector subspaces of an n-dimensional vector space over Fq (a Grassmannian). For example, the Gaussian binomial
is the number of different lines in Fqn (a projective space).
In the conventions common in applications to quantum groups, a slightly different definition is used; the quantum binomial there is
- .
This version of the quantum binomial is symmetric under exchange of q and q − 1.
[edit] References
- Eugene Mukhin, Symmetric Polynomials and Partitions (undated, 2004 or earlier).
- Ratnadha Kolhatkar, Zeta function of Grassmann Varietes (dated January 26, 2004)
- Eric W. Weisstein, q-Binomial Coefficient at MathWorld.