Coefficients of Gaussian polynomials modulo \(N\) (Q782934)

Summary: Let \(\left[\begin{smallmatrix} n \\ k \end{smallmatrix}\right]_q\) be a \(q\)-binomial coefficient. \textit{R. P. Stanley} [Enumerative combinatorics. Vol. 1. With a foreword by Gian-Carlo Rota. Corrected reprint of the 1986 hardback edition. Cambridge: Cambridge University Press (1999; Zbl 0945.05006)] conjectured that the function \(f_{k}(n) = \#\{\alpha : [q^\alpha] \left[\begin{smallmatrix} n \\ k \end{smallmatrix}\right]_q \equiv R \pmod N\}\) is quasi-polynomial for \(N\) prime. We prove this for any integer \(N\) and obtain an expression for the generating function \(F_{k}(x)\) for \(f_{k}(n)\).