English

Coefficients of Gaussian Polynomials Modulo $N$

Combinatorics 2020-07-15 v2

Abstract

The qq-analogue of the binomial coefficient, known as a qq-binomial coefficient, is typically denoted [nk]q\left[{n \atop k}\right]_q. These polynomials are important combinatorial objects, often appearing in generating functions related to permutations and in representation theory. Stanley conjectured that the function fk,R(n)=#{i:[qi][nk]qR(modN)}f_{k,R}(n) = \#\left\{i : [q^{i}] \left[{n \atop k}\right]_q \equiv R \pmod{N}\right\} is quasipolynomial for N=2N=2. We generalize, showing that this is in fact true for any integer NNN\in \mathbb{N} and determine a quasi-period πN(k)\pi'_N(k) derived from the minimal period πN(k)\pi_N(k) of partitions with at most kk parts modulo NN.

Keywords

Cite

@article{arxiv.1801.00188,
  title  = {Coefficients of Gaussian Polynomials Modulo $N$},
  author = {Dylan Pentland},
  journal= {arXiv preprint arXiv:1801.00188},
  year   = {2020}
}
R2 v1 2026-06-22T23:33:01.317Z