首页> 外文期刊>Journal of Combinatorial Theory, Series A >A bijection for partitions with all ranks at least t
【24h】

A bijection for partitions with all ranks at least t

机译:所有等级至少为t的分区的双射

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

摘要

It follows from the work of Andrews and Bressoud that for t less than or equal to 1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size 2 - t. We give a simple bijection for this identity which generalizes a result of Cheema and Gordon for 2 rowed plane partitions. The bijection yields several refinements of the identity when the partition counts are parametrized by the number of parts and:or the size of the Durfee rectangle. In addition, it gives an interpretation of the difference of(shifted) successive Gaussian polynomials which we relate to other interpretations of Andrews and Fishel. (C) 1998 Academic Press. [References: 15]
机译:从Andrews和Bressoud的工作得出,对于小于或等于1的t,所有连续等级至少为t的n的分区数等于不包含大小为2-t的n的分区数。我们对此身份给出一个简单的双射,它概括了Cheema和Gordon对2行平面分区的结果。当分区计数由零件数和/或Durfee矩形的大小参数化时,双射可对身份进行若干细化。另外,它给出了(移位的)连续高斯多项式之差的解释,这与我们对Andrews和Fishel的其他解释有关。 (C)1998年学术出版社。 [参考:15]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号