# Gaussian binomial coefficient

The **Gaussian binomial coefficient**, also called the **q-binomial coefficient** or **Gaussian polynomial**, is a polynomial in a parameter \( q \) that generalizes the ordinary binomial coefficient and counts the \( k \)-dimensional subspaces of an \( n \)-dimensional vector space over the finite field with \( q \) elements<sup>[1](https://mathworld.wolfram.com/q-BinomialCoefficient.html)</sup><sup> • </sup><sup>[2](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)</sup>. For integers \( n \geq k \geq 0 \) it is defined by

\[
\begin{bmatrix} n \\ k \end{bmatrix}_{q} = \frac{(q;q)_{n}}{(q;q)_{k}\,(q;q)_{n-k}},
\]

where \( (a;q)_{k} \) is the q-[Pochhammer symbol](https://www.edgepedia.org/pochhammer-symbol), the q-shifted factorial<sup>[3](https://arxiv.org/abs/2606.01919)</sup>. Equivalently it has the product form

\[
\begin{bmatrix} n \\ k \end{bmatrix}_{q} = \prod_{i=0}^{k-1} \frac{1 - q^{n-i}}{1 - q^{i+1}},
\]

which is a polynomial in \( q \) with nonnegative integer coefficients<sup>[1](https://mathworld.wolfram.com/q-BinomialCoefficient.html)</sup><sup> • </sup><sup>[3](https://arxiv.org/abs/2606.01919)</sup>. Setting \( q = 1 \) recovers the ordinary binomial coefficient \( \binom{n}{k} \)<sup>[4](https://arxiv.org/abs/2505.08024)</sup>.

| Key fact | Detail |
|---|---|
| Definition | \( \begin{bmatrix} n \\ k \end{bmatrix}_{q} = (q;q)_{n} / ((q;q)_{k}(q;q)_{n-k}) \), a polynomial in \( q \) with nonnegative integer coefficients<sup>[3](https://arxiv.org/abs/2606.01919)</sup> |
| Product form | \( \prod_{i=0}^{k-1} (1-q^{n-i})/(1-q^{i+1}) \)<sup>[1](https://mathworld.wolfram.com/q-BinomialCoefficient.html)</sup> |
| Finite-field count | Equals the number of \( k \)-dimensional subspaces of \( \mathbb{F}_{q}^{n} \)<sup>[2](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)</sup> |
| Partition interpretation | Generating function for integer partitions whose Young diagrams fit in a \( k \times n \) box<sup>[2](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)</sup> |
| Unimodality | Coefficients are unimodal, conjectured by Cayley in 1852 and proved by Sylvester in 1878 using invariant theory<sup>[5](https://arxiv.org/abs/1711.11252)</sup> |
| q-binomial theorem | \( \prod_{i=1}^{n-1} (1 + q^{i} t) = \sum_{k=0}^{n} q^{\binom{k}{2}} \begin{bmatrix} n \\ k \end{bmatrix}_{q} t^{k} \)<sup>[2](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)</sup> |
| Recurrences | q-analogs of Pascal's rule, e.g. \( \begin{bmatrix} n \\ m \end{bmatrix}_{q} = \begin{bmatrix} n-1 \\ m-1 \end{bmatrix}_{q} + q^{m} \begin{bmatrix} n-1 \\ m \end{bmatrix}_{q} \)<sup>[6](https://dlmf.nist.gov/17.2)</sup> |

## History

The name honors [Carl Friedrich Gauss](https://www.edgepedia.org/carl-friedrich-gauss). He came upon series of this type around 1794 in his work on the arithmetic-geometric mean, and his 1808 paper on q-series dealt with a generalization of the binomial coefficient and binomial series, defining the Gaussian polynomial<sup>[7](https://assets.cambridge.org/97811087/09378/excerpt/9781108709378_excerpt.pdf)</sup>. The earliest known published statement of the q-binomial theorem appears in the introduction to the 1811 second volume of Rothe's textbook *Handbuch der reinen Mathematik*, where Rothe describes material his publisher forced him to cut for space; a full treatment and proof was published soon after in Gruson's 1818 article *Neuer analytischer Lehrsatz*<sup>[8](https://enumeration.ca/extensions/q-analogues/)</sup>.

## Combinatorial meanings

**Subspaces of finite vector spaces.** The coefficient \( \begin{bmatrix} n \\ k \end{bmatrix}_{q} \) equals the number of \( k \)-dimensional subspaces of \( \mathbb{F}_{q}^{n} \), the \( n \)-dimensional vector space over the finite field with \( q \) elements<sup>[2](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)</sup>. The count is obtained by computing the number of possible bases of a \( k \)-subspace and dividing by the size of the general linear group \( GL(k,q) \) to remove overcounting<sup>[2](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)</sup>. This is the central object of the q-analog program, in which classical combinatorial formulas for finite sets are extended to finite vector spaces, with \( q \) the cardinality of the base field \( GF(q) \), a power of a prime<sup>[9](https://pisrt.org/psr-press/journals/oms/01-vol-10-2026-issue-1/on-the-number-of-direct-sum-decompositions-of-a-finite-vector-space/)</sup>.

**Partitions.** The same polynomial is the generating function \( \sum_{\lambda} q^{|\lambda|} \) over all integer partitions \( \lambda \) whose Young diagrams fit inside a \( k \)-row by \( n \)-column box, where \( |\lambda| \) is the sum of the parts<sup>[2](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)</sup>. In this form it is a fundamental object of the theory of integer partitions: for \( M, N \geq 0 \), the generating function for the number \( p_{M,N}(n) \) of partitions of \( n \) with at most \( M \) parts, each not exceeding \( N \), is \( \begin{bmatrix} N+M \\ M \end{bmatrix}_{q} \)<sup>[10](https://arxiv.org/abs/2510.08262)</sup>.

**Permutations and lattice paths.** The q-factorial \( [n]!_{q} = \sum_{\pi \in S_{n}} q^{\mathrm{inv}(\pi)} \) records the distribution of the inversion statistic over permutations, and the Gaussian coefficients are built from these q-integers<sup>[8](https://enumeration.ca/extensions/q-analogues/)</sup>. Gaussian polynomials also give the number of lattice paths lying between two arbitrary boundaries and having a given area below the path, a formula expressed as a determinant involving the polynomials, with statistical applications<sup>[11](https://epubs.siam.org/doi/10.1137/0511090)</sup>.

## Algebraic properties

The Gaussian coefficients satisfy q-analogs of the classical binomial identities. Two q-Pascal recurrences read

\[
\begin{bmatrix} n \\ m \end{bmatrix}_{q} = \begin{bmatrix} n-1 \\ m-1 \end{bmatrix}_{q} + q^{m} \begin{bmatrix} n-1 \\ m \end{bmatrix}_{q},
\qquad
\begin{bmatrix} n \\ m \end{bmatrix}_{q} = \begin{bmatrix} n-1 \\ m \end{bmatrix}_{q} + q^{n-m} \begin{bmatrix} n-1 \\ m-1 \end{bmatrix}_{q},
\]

and the array has the same symmetry \( \begin{bmatrix} n \\ k \end{bmatrix}_{q} = \begin{bmatrix} n \\ n-k \end{bmatrix}_{q} \) as the ordinary binomial coefficients<sup>[6](https://dlmf.nist.gov/17.2)</sup><sup> • </sup><sup>[12](https://maths.qmul.ac.uk/~bill/MTHM030/counting.pdf)</sup>. The q-binomial theorem in the form

\[
\prod_{i=1}^{n-1} (1 + q^{i} t) = \sum_{k=0}^{n} q^{\binom{k}{2}} \begin{bmatrix} n \\ k \end{bmatrix}_{q} t^{k}
\]

follows by induction from the partition recurrence<sup>[2](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)</sup>. At roots of unity the values are governed by the q-Lucas theorem, the canonical tool for evaluating a general q-binomial at \( q = \exp(2\pi i r/N) \)<sup>[13](https://mathoverflow.net/questions/280739/q-binomials-at-roots-of-unity/361550)</sup>. The coefficients need not be log-concave in general<sup>[2](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)</sup>.

## Unimodality

The coefficients of \( \begin{bmatrix} n \\ k \end{bmatrix}_{q} \) rise and then fall, a property called unimodality. For example \( \begin{bmatrix} 4 \\ 2 \end{bmatrix}_{q} = 1 + q + 2q^{2} + q^{3} + q^{4} \)<sup>[2](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)</sup>. The q-binomial coefficients were assumed to be unimodal as early as the 1850s, but this remained unproven until [James Joseph Sylvester](https://www.edgepedia.org/james-joseph-sylvester)'s 1878 proof using invariant theory, which settled a conjecture of Cayley from 1852<sup>[5](https://arxiv.org/abs/1711.11252)</sup>. Several other proofs followed over the years using different techniques, including linear algebra and the hard Lefschetz theorem; in 1989 Kathleen O'Hara, a combinatorialist, provided a purely combinatorial proof by decomposing the ranked set of partitions in the box into a centered disjoint union of products of chains<sup>[5](https://arxiv.org/abs/1711.11252)</sup>. Strict unimodality, meaning strict increase up to the middle rank, was proved by Pak and Panova for \( m, n \geq 8 \) via the [representation theory of the symmetric group](https://www.edgepedia.org/representation-theory-of-the-symmetric-group), with a direct combinatorial proof given afterward by Vivek Dhand, a mathematician then working on the [partition lattice](https://www.edgepedia.org/partition-lattice)<sup>[14](https://arxiv.org/abs/1402.1199)</sup>.

## Interpretations beyond subspace counting

**Group theory.** If \( G \) is a finite \( p \)-group of rank \( n \), then \( \binom{n}{k}_{p} \) counts exactly those subgroups of \( G \) whose minimal expression is as an intersection of \( n - k \) maximal subgroups of \( G \); adding these coefficients together yields the count of subgroups that are either \( G \) itself or intersections of maximal subgroups<sup>[15](https://arxiv.org/abs/2108.10956)</sup>. The same work supplies field-theoretic interpretations through [Galois theory](https://www.edgepedia.org/galois-theory) and topological ones through covering spaces<sup>[15](https://arxiv.org/abs/2108.10956)</sup>.

**Coding theory.** The q-binomials determine cardinalities of certain error-correcting codes based on Varshamov-Tenengolts codes, which correct deletion errors, and capture a phenomenon of the deletion sphere for specific cases<sup>[16](https://arxiv.org/abs/1906.03385)</sup>. Gaussian polynomials are also connected to the second-order Reed-Muller code<sup>[10](https://arxiv.org/abs/2510.08262)</sup>.

**Formal languages.** Recent research defines q-analogs of binomial coefficients for words, carrying the Gaussian coefficients over from integers to members of a free monoid, and applies them to extend an Eilenberg theorem that characterizes what are called p-group languages: such a language arises exactly when it can be built as a Boolean combination of particular languages given by q-binomial coefficients interpreted as polynomials over \( \mathbb{F}_{p} \)<sup>[17](https://orbi.uliege.be/handle/2268/329468)</sup>.

**Extensions.** The definition extends beyond integer upper arguments: for a nonnegative integer \( k \) and rational \( r \in \mathbb{Q}^{+} \), the generalized coefficient \( \begin{bmatrix} r+k \\ k \end{bmatrix}_{q} = (q^{r+1}; q)_{k} / (q; q)_{k} \) coincides with the classical Gaussian binomial coefficient when \( r \) is a positive integer, and for non-integer \( r \) it becomes a [Puiseux series](https://www.edgepedia.org/puiseux-series) in \( q \)<sup>[3](https://arxiv.org/abs/2606.01919)</sup>.

## Related structures

The Gaussian coefficients appear throughout enumerative combinatorics and representation theory, especially where partitions are involved, and many classical binomial formulas have Gaussian versions, a process viewed as part of the broader phenomenon of quantization<sup>[18](https://www.youtube.com/watch?v=uLeLQEDGA_Q)</sup>. They arise in the cyclic sieving phenomenon alongside Pólya-Redfield theory, polygon dissections, noncrossing partitions, and finite reflection groups<sup>[19](https://www.sciencedirect.com/science/article/pii/S0097316504000822)</sup>, and in the study of Grassmannians, where the q-binomial coefficient encodes the cell decomposition of the [Grassmannian](https://www.edgepedia.org/grassmannian) of \( k \)-planes in \( \mathbb{F}_{q}^{n} \)<sup>[20](https://math.ucr.edu/home/baez/qg-fall2007/pascal.html)</sup>. Deep connections link Gaussian polynomials to Kronecker coefficients in representation theory<sup>[10](https://arxiv.org/abs/2510.08262)</sup>.

## References

1. [q-Binomial Coefficient, Wolfram MathWorld](https://mathworld.wolfram.com/q-BinomialCoefficient.html)
2. [Gaussian Coefficients, lecture notes, UCLA (Igor Pak)](https://www.math.ucla.edu/~pak/courses/206-Fall-2013/206-merge-2013.pdf)
3. [Guo-Niu Han, Huan Xiong. The 1/2-Conjecture for q-Binomial Coefficients with Fractional Index. arXiv:2606.01919](https://arxiv.org/abs/2606.01919)
4. [Nate Harman. The "Shape" of q-Binomial Coefficients. arXiv:2505.08024](https://arxiv.org/abs/2505.08024)
5. [q-Binomials and related symmetric unimodal polynomials. arXiv:1711.11252](https://arxiv.org/abs/1711.11252)
6. [DLMF §17.2: q-Hypergeometric and Related Functions, NIST Digital Library of Mathematical Functions](https://dlmf.nist.gov/17.2)
7. [Cambridge University Press, excerpt on Gauss and q-series](https://assets.cambridge.org/97811087/09378/excerpt/9781108709378_excerpt.pdf)
8. [q-analogues, An Invitation to Enumeration](https://enumeration.ca/extensions/q-analogues/)
9. [On the number of direct-sum decompositions of a finite vector space, PISRT](https://pisrt.org/psr-press/journals/oms/01-vol-10-2026-issue-1/on-the-number-of-direct-sum-decompositions-of-a-finite-vector-space/)
10. [Wenxia Qu, Wenston J. T. Zang. New combinatorial proof of Gaussian polynomial and the monotonicity of the Garvan's k-rank. arXiv:2510.08262](https://arxiv.org/abs/2510.08262)
11. [On q-Binomial Coefficients and Some Statistical Applications, SIAM Journal on Mathematical Analysis](https://epubs.siam.org/doi/10.1137/0511090)
12. [Notes on Counting, Queen Mary University of London (Bill Jackson)](https://maths.qmul.ac.uk/~bill/MTHM030/counting.pdf)
13. [Q-binomials at roots of unity, MathOverflow](https://mathoverflow.net/questions/280739/q-binomials-at-roots-of-unity/361550)
14. [Vivek Dhand. A combinatorial proof of strict unimodality for q-binomial coefficients. arXiv:1402.1199](https://arxiv.org/abs/1402.1199)
15. [Gaussian Binomial Coefficients in Group Theory, Field Theory, and Topology. arXiv:2108.10956](https://arxiv.org/abs/2108.10956)
16. [Manabu Hagiwara, Justin Kong. Applications of Gaussian Binomials to Coding Theory for Deletion Error Correction. arXiv:1906.03385](https://arxiv.org/abs/1906.03385)
17. [Renard, Rigo, Whiteland. Introducing q-deformed binomial coefficients of words, Journal of Algebraic Combinatorics (2025), ORBi](https://orbi.uliege.be/handle/2268/329468)
18. [Quantising the binomial formula with partition combinatorics, DanielChanMaths (YouTube)](https://www.youtube.com/watch?v=uLeLQEDGA_Q)
19. [The cyclic sieving phenomenon, Journal of Combinatorial Theory A](https://www.sciencedirect.com/science/article/pii/S0097316504000822)
20. [John Baez, Pascal's triangle and the Grassmannian](https://math.ucr.edu/home/baez/qg-fall2007/pascal.html)

---
*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics › Logic and discrete mathematics › General discrete mathematics and discrete structures › Combinatorics › Enumerative combinatorics › Generating functions and symbolic methods › q-analogs and q-series*

*Initially written Sep 17, 2026 · Reviewed: Oct 15, 2026 · Edited: Oct 15, 2026 · Last review: Oct 15, 2026*

*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*

License: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license