Coefficients of Gaussian Polynomials Modulo N

Abstract

The q-analogue of the binomial coefficient, known as a q-binomial coefficient, is typically denoted [n k]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] [n k]q R N\ is quasipolynomial for N=2. We generalize, showing that this is in fact true for any integer N∈ N and determine a quasi-period π'N(k) derived from the minimal period πN(k) of partitions with at most k parts modulo N.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…