...
【24h】

Generating Function for M(m,n)

机译:M(m,n)的生成函数

获取原文
           

摘要

This paper shows that the coefficient of x in the right hand side of the equation is an algebraic relation in terms of z. The exponent of z represents the crank of partitions of a positive integral value of n and also shows that the sum of weights of corresponding partitions of n is the sum of ordinary partitions of n and it is equal to the number of partitions of n with crank m. This paper shows how to prove the Theorem “The number of partitions of n with crank C()=m is M(m,n) for all n>1.”.
机译:本文表明,方程右侧的x系数是z的代数关系。 z的指数表示正整数值n的分区的曲柄,并且还表明n的相应分区的权重之和是n的普通分区的总和,并且等于带有曲柄的n的分区数米本文展示了如何证明定理“对于所有n> 1,曲柄C()= m的n的分割数为M(m,n)”。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号