OurBigBook About$ Donate
 Sign in Sign up

Gaussian multinomial coefficient ((k1​,…,kr​n​)q​)

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Binomial coefficient Gaussian binomial coefficient
Created 2026-10-20 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
For nonnegative k1​,…,kr​ with sum n, the Gaussian multinomial coefficient is
(k1​,…,kr​n​)q​=∏j=1r​(kj​n−∑i<j​ki​​)q​.
(1)
It is a polynomial in q and at q=1 gives the ordinary multinomial coefficient. For a prime power q, it counts flags in Fqn​ whose successive dimension increments are k1​,…,kr​: choose each new subspace in the quotient by the previous one, using Gaussian binomial coefficients. For (k1​,k2​,k3​)=(1,1,1), the value is (1+q+q2)(1+q), giving 21 complete flags over F2​.

 Ancestors (6)

  1. Gaussian binomial coefficient
  2. Binomial coefficient
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Gaussian multinomial coefficient

 Synonyms (1)

  • codex/q-multinomial-coefficient

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook