首页> 外文期刊>Journal of Combinatorial Theory, Series A >Lecture hall theorems, q-series and truncated objects
【24h】

Lecture hall theorems, q-series and truncated objects

机译:演讲厅定理,q系列和截断的对象

获取原文
获取原文并翻译 | 示例
       

摘要

We show here that the refined theorems for both lecture hall partitions and anti-lecture hall compositions can be obtained as straightforward consequences of two q-Chu Vandermonde identities, once an appropriate recurrence is derived. We use this approach to get new lecture hall-type theorems for truncated objects. The truncated lecture hall partitions are sequences (lambda(1),..., lambda(k)) such thatlambda(1) greater than or equal to lambda(2)-1 greater than or equal to (...) greater than or equal to lambda(k)-k+1 greater than or equal to 0and we show that their generating function isSigma(m=0)(k) [n/m](q)q((m+1/2))(-q(n-m+1); q)(m)/(q(2n-m+1);q)(m).From this, we are able to give a combinatorial characterization of truncated lecture hall partitions and new finite versions of refinements of Euler's theorem. The truncated anti-lecture hall compositions are sequences (lambda(1),..., lambda(k)) such thatlambda(1)-k+1 greater than or equal to lambda(2)-k+2 greater than or equal to (...) greater than or equal to lambda(k) greater than or equal to 0.We show that their generating function is[n/k](q) (-q(n-k+1);q)(k)/(q(2(n-k+1)); q)(k),giving a finite version of a well-known partition identity. We give two different multivariate refinements of these new results: the q-calculus approach gives (u, v, q)-refinements, while a completely different approach gives odd/even (x, y)-refinements. (C) 2004 Elsevier Inc. All rights reserved.
机译:我们在这里显示,一旦派生了适当的递归,就可以通过两个q-Chu Vandermonde身份的直接结果来获得针对演讲厅分区和反演讲厅组成的改进定理。我们使用这种方法为截断的对象获得新的演讲厅型定理。截断的演讲厅分区是序列(lambda(1),...,lambda(k)),使得lambda(1)/ n大于或等于lambda(2)/ n-1大于或等于(.. 。)大于或等于lambda(k)/ n-k + 1大于或等于0,我们证明它们的生成函数为Sigma(m = 0)(k)[n / m](q)q((m +1/2))(-q(n-m + 1); q)(m)/(q(2n-m + 1); q)(m)从中我们可以给出组合特征截断的演讲厅分区和Euler定理细化的新有限形式。截断的抗讲堂成分是序列(lambda(1),...,lambda(k)),使得lambda(1)/ n-k + 1大于或等于lambda(2)/ n-k + 2大于或等于(...)大于或等于lambda(k)/ n大于或等于0。我们证明它们的生成函数为[n / k](q)(-q(n-k +1); q)(k)/(q(2(n-k + 1)); q)(k),给出了已知分区标识的有限版本。我们对这些新结果进行了两种不同的多元细化:q-演算方法给出了(u,v,q)-细化,而完全不同的方法给出了奇数/偶数(x,y)-细化。 (C)2004 Elsevier Inc.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号