2000 character limit reached
A q-analogue of some binomial coefficient identities of Y. Sun
Published 9 Aug 2010 in math.CO | (1008.1469v2)
Abstract: We give a $q$-analogue of some binomial coefficient identities of Y. Sun [Electron. J. Combin. 17 (2010), #N20] as follows: {align*} \sum_{k=0}{\lfloor n/2\rfloor}{m+k\brack k}{q2}{m+1\brack n-2k}{q} q{n-2k\choose 2} &={m+n\brack n}{q}, \sum{k=0}{\lfloor n/4\rfloor}{m+k\brack k}{q4}{m+1\brack n-4k}{q} q{n-4k\choose 2} &=\sum_{k=0}{\lfloor n/2\rfloor}(-1)k{m+k\brack k}{q2}{m+n-2k\brack n-2k}{q}, {align*} where ${n\brack k}_q$ stands for the $q$-binomial coefficient. We provide two proofs, one of which is combinatorial via partitions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.