An overpartition analogue of the q-binomial coefficients

We define an overpartition analogue of Gaussian polynomials (also known as q-binomial coefficients) as a generating function for the number of overpartitions fitting inside the M×N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M \times N$$\end{document} rectangle. We call these new polynomials over Gaussian polynomials or over q-binomial coefficients. We investigate basic properties and applications of over q-binomial coefficients. In particular, via the recurrences and combinatorial interpretations of over q-binomial coefficients, we prove a Rogers–Ramanujan type partition theorem.