Coefficients of Gaussian polynomials modulo N

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15)

Abstract: The

q

-analogue of the binomial coefficient, known as a

q

-binomial coefficient, is typically denoted

l e f t [n a t o p k i g h t]_{q}

. These polynomials are important combinatorial objects, often appearing in generating functions related to permutations and in representation theory. Stanley conjectured that the function

is quasipolynomial for

N = 2

. We generalize, showing that this is in fact true for any integer

N i n m a t h b b N

and determine a quasi-period

p i'_{N} (k)

derived from the minimal period

p i_{N} (k)

of partitions with at most

k

parts modulo

N

.

Review text

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)\).

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Coefficients of Gaussian polynomials modulo \(N\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782934)