Author:
BRENNAN CHARLOTTE,KNOPFMACHER ARNOLD,WAGNER STEPHAN
Abstract
A partition of a positive integer n is a finite sequence of positive integers a1, a2, . . ., ak such that a1+a2+ċ ċ ċ+ak=n and ai+1 ≥ ai for all i. Let d be a fixed positive integer. We say that we have an ascent of size d or more if ai+1 ≥ ai+d.We determine the mean, the variance and the limiting distribution of the number of ascents of size d or more (equivalently, the number of distinct part sizes of multiplicity d or more) in the partitions of n.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference9 articles.
1. [8] Lewin L. (1981) Polylogarithms and Associated Functions, North-Holland, New York.
2. The distribution of the number of summands in the partitions of a positive integer;Erdo″s;Duke Math. J.,1941
3. Gaps in integer partitions;Knopfmacher;Utilitas Mathematica,2006
4. Limit Theorems for the Number of Summands in Integer Partitions
5. On the multiplicity of parts in a random partition
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献