Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Consider an $n \times 1 - $rectangle where the $n$ squares are numbered $1$ to $n$. Cover this rectangle with white squares $a$, black squares $b$ and dominoes $dd$. To each covering of the rectangle associate the following weight: Each white square has weight 1, each black square at position $i$ has weight $q^ir$ and each domino at position $\left\{ {i,i + 1} \right\}$ has weight $q^i.$ The weight of a covering is the product of its components and the weight of a set of coverings is the sum of their weights.

Then it is easy to verify that the weight $u(n,k,r)$ of all coverings with precisely $k$ dominoes is the product $u(n,k,r)=u(n,k,0)v(n,k,r)$ with $u(n,k,0)= {q^{k^2}}{n-k\brack k} $ and $v(n,k,r) = (1 + {q^{k + 1}}r)(1 + {q^{k + 2}}r) \cdots (1 + {q^{n - k}}r).$

My question is: Does this product representation exist by lucky chance or is there a simple combinatorial reason for it?

share|cite|improve this question
+1 interesting, but what do you mean by ${n-k\brack k}$? – draks ... May 7 '12 at 10:56
@draks: Let $[n]=(1-q^n)/(1-q).$ Then ${n\brack k}=[1][2]\dots[n]/([1]\dots [k]\cdot[1]\dots[n-k]).$ – Johann Cigler May 7 '12 at 11:06
@draks: It is the q-analog of the binomial coefficient. – anon May 7 '12 at 12:00

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.