<p>Let <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\([n]!=\prod _{i=1}^n(1+q+\cdots +q^{i-1})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo stretchy="false">]</mo> </mrow> <mo>!</mo> <mo>=</mo> <msubsup> <mo>∏</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo>+</mo> <mi>q</mi> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msup> <mi>q</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the <i>q</i>-factorials and let <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\({n\brack k}=[n]!/([k]![n-k]!)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mfenced close="]" open="["> <mfrac linethickness="0pt"> <mi>n</mi> <mi>k</mi> </mfrac> </mfenced> <mo>=</mo> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo stretchy="false">]</mo> </mrow> <mo>!</mo> <mo stretchy="false">/</mo> <mrow> <mo stretchy="false">(</mo> <mrow> <mo stretchy="false">[</mo> <mi>k</mi> <mo stretchy="false">]</mo> </mrow> <mo>!</mo> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo>-</mo> <mi>k</mi> <mo stretchy="false">]</mo> </mrow> <mo>!</mo> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> be the <i>q</i>-binomial coefficients, where <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(1/[k]!=0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo stretchy="false">/</mo> <mo stretchy="false">[</mo> <mi>k</mi> <mo stretchy="false">]</mo> <mo>!</mo> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> if <i>k</i> is a negative integer. Let <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(m_1,\ldots ,m_r,m_{r+1}=m_1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>m</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>m</mi> <mi>r</mi> </msub> <mo>,</mo> <msub> <mi>m</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>m</mi> <mn>1</mn> </msub> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(n_1,\ldots ,n_s\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>n</mi> <mi>s</mi> </msub> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(n_{s+1}=n_1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>n</mi> <mrow> <mi>s</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>n</mi> <mn>1</mn> </msub> </mrow> </math></EquationSource> </InlineEquation> be positive integers with <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(r,s\geqslant 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>r</mi> <mo>,</mo> <mi>s</mi> <mo>⩾</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. We prove that the alternating sum <Equation ID="Equ27"> <EquationSource Format="TEX">\(\begin{aligned}&amp;\frac{[m_1]![n_1]![m_r+n_s+1]!}{[m_1+m_r+1]![n_1+n_s]!}\sum _{k=-n_1}^{n_1}(-1)^k q^{ak^2+(2r-1){k\atopwithdelims ()2}}\\&amp;\quad \times \prod _{i=1}^{r}{m_i+m_{i+1}+1\brack m_i+k}\cdot \prod _{j=1}^s {n_j+n_{j+1}\brack n_j+k} \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd /> <mtd columnalign="left"> <mrow> <mfrac> <mrow> <mrow> <mo stretchy="false">[</mo> <msub> <mi>m</mi> <mn>1</mn> </msub> <mo stretchy="false">]</mo> </mrow> <mo>!</mo> <mrow> <mo stretchy="false">[</mo> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo stretchy="false">]</mo> </mrow> <mo>!</mo> <mrow> <mo stretchy="false">[</mo> <msub> <mi>m</mi> <mi>r</mi> </msub> <mo>+</mo> <msub> <mi>n</mi> <mi>s</mi> </msub> <mo>+</mo> <mn>1</mn> <mo stretchy="false">]</mo> </mrow> <mo>!</mo> </mrow> <mrow> <mrow> <mo stretchy="false">[</mo> <msub> <mi>m</mi> <mn>1</mn> </msub> <mo>+</mo> <msub> <mi>m</mi> <mi>r</mi> </msub> <mo>+</mo> <mn>1</mn> <mo stretchy="false">]</mo> </mrow> <mo>!</mo> <mrow> <mo stretchy="false">[</mo> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>+</mo> <msub> <mi>n</mi> <mi>s</mi> </msub> <mo stretchy="false">]</mo> </mrow> <mo>!</mo> </mrow> </mfrac> <munderover> <mo>∑</mo> <mrow> <mi>k</mi> <mo>=</mo> <mo>-</mo> <msub> <mi>n</mi> <mn>1</mn> </msub> </mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> </munderover> <msup> <mrow> <mo stretchy="false">(</mo> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msup> <msup> <mi>q</mi> <mrow> <mi>a</mi> <msup> <mi>k</mi> <mn>2</mn> </msup> <mo>+</mo> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mi>r</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mfenced close=")" open="("> <mfrac linethickness="0pt"> <mi>k</mi> <mn>2</mn> </mfrac> </mfenced> </mrow> </msup> </mrow> </mtd> </mtr> <mtr> <mtd columnalign="right"> <mrow /> </mtd> <mtd columnalign="left"> <mrow> <mspace width="1em" /> <mo>×</mo> <munderover> <mo>∏</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>r</mi> </munderover> <mfenced close="]" open="["> <mfrac linethickness="0pt"> <mrow> <msub> <mi>m</mi> <mi>i</mi> </msub> <mo>+</mo> <msub> <mi>m</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>+</mo> <mn>1</mn> </mrow> <mrow> <msub> <mi>m</mi> <mi>i</mi> </msub> <mo>+</mo> <mi>k</mi> </mrow> </mfrac> </mfenced> <mo>·</mo> <munderover> <mo>∏</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>s</mi> </munderover> <mfenced close="]" open="["> <mfrac linethickness="0pt"> <mrow> <msub> <mi>n</mi> <mi>j</mi> </msub> <mo>+</mo> <msub> <mi>n</mi> <mrow> <mi>j</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mrow> <mrow> <msub> <mi>n</mi> <mi>j</mi> </msub> <mo>+</mo> <mi>k</mi> </mrow> </mfrac> </mfenced> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>is a polynomial in <i>q</i> with non-negative integer coefficients for <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(0\leqslant a\leqslant s\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>0</mn> <mo>⩽</mo> <mi>a</mi> <mo>⩽</mo> <mi>s</mi> </mrow> </math></EquationSource> </InlineEquation>. We also propose some related conjectures.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Factors of a kind of alternating sums of products of q-binomial coefficients

  • Victor J. W. Guo

摘要

Let \([n]!=\prod _{i=1}^n(1+q+\cdots +q^{i-1})\) [ n ] ! = i = 1 n ( 1 + q + + q i - 1 ) denote the q-factorials and let \({n\brack k}=[n]!/([k]![n-k]!)\) n k = [ n ] ! / ( [ k ] ! [ n - k ] ! ) be the q-binomial coefficients, where \(1/[k]!=0\) 1 / [ k ] ! = 0 if k is a negative integer. Let \(m_1,\ldots ,m_r,m_{r+1}=m_1\) m 1 , , m r , m r + 1 = m 1 and \(n_1,\ldots ,n_s\) n 1 , , n s , \(n_{s+1}=n_1\) n s + 1 = n 1 be positive integers with \(r,s\geqslant 1\) r , s 1 . We prove that the alternating sum \(\begin{aligned}&\frac{[m_1]![n_1]![m_r+n_s+1]!}{[m_1+m_r+1]![n_1+n_s]!}\sum _{k=-n_1}^{n_1}(-1)^k q^{ak^2+(2r-1){k\atopwithdelims ()2}}\\&\quad \times \prod _{i=1}^{r}{m_i+m_{i+1}+1\brack m_i+k}\cdot \prod _{j=1}^s {n_j+n_{j+1}\brack n_j+k} \end{aligned}\) [ m 1 ] ! [ n 1 ] ! [ m r + n s + 1 ] ! [ m 1 + m r + 1 ] ! [ n 1 + n s ] ! k = - n 1 n 1 ( - 1 ) k q a k 2 + ( 2 r - 1 ) k 2 × i = 1 r m i + m i + 1 + 1 m i + k · j = 1 s n j + n j + 1 n j + k is a polynomial in q with non-negative integer coefficients for \(0\leqslant a\leqslant s\) 0 a s . We also propose some related conjectures.