2 edited tags
1

# Combinatorial Interpretation of an Extension of Gaussian Polynomials

It is well-known that the Gaussian polynomial (or Gaussian coefficient, q-binomial coefficient) $\binom{n}{k}_q$ counts the number of $k$-dimensional subspaces of an $n$-dimensional vector space over $GF(q)$.

A generalization of $\binom{n}{k}_q$ are the so-called $p,q$-binomial coefficients,

$\binom{n}{k}_{p,q}=\frac{{[n]}!}{[k]![n-k]!}$,

where $[n]=\frac{p^n-q^n}{p-q}$ and $[n]!=[n][n-1]\cdots[2][1]$.

The $p,q$-binomials equal the $q$-binomials when $q=1$.

Question 1: Is there a vector space combinatorial interpretation for the $p,q$-binomials? If there is, how does the underlying two-parameter field look like? (There is a combinatorial interpretation in terms of tableaux and lattice paths but I'm more interested with the subspace interpretation.)

Question 2 (somewhat related): A number of mathematicians have talked about the so-called $q$-disease (the widespread (at least those among working in $q$-series) interest in extending classical results to $q$-analogues.) Is there a $p,q$-disease?

PS I'm supposed to write $[n]_{p,q}$ but it doesn't seem to work with \frac.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 18, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.895544171333313, "perplexity_flag": "head"}