Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T16:03:35.491Z Has data issue: false hasContentIssue false

The Distribution of Ascents of Size d or More in Partitions of n

Published online by Cambridge University Press:  01 July 2008

CHARLOTTE BRENNAN
Affiliation:
School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits 2050, Johannesburg, South Africa (e-mail: Charlotte.Brennan@wits.ac.za)
ARNOLD KNOPFMACHER
Affiliation:
The John Knopfmacher Centre for Applicable Analysis and Number Theory, School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits 2050, Johannesburg, South Africa (e-mail: Arnold.Knopfmacher@wits.ac.za)
STEPHAN WAGNER
Affiliation:
Institute for Analysis and Computational Number Theory, Graz University of Technology, Steyrergasse 30, 8010 Graz, Austria (e-mail: wagner@finanz.math.tugraz.at)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Paper
Copyright
© Cambridge University Press 2008