Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-12T09:24:58.828Z Has data issue: false hasContentIssue false

A General Asymptotic Scheme for the Analysis of Partition Statistics

Published online by Cambridge University Press:  08 September 2014

PETER J. GRABNER
Affiliation:
Institut für Analysis und Computational Number Theory, Technische Universität Graz, Steyrergasse 30, 8010 Graz, Austria (e-mail: peter.grabner@tugraz.at)
ARNOLD KNOPFMACHER
Affiliation:
The John Knopfmacher Centre for Applicable Analysis and Number Theory, School of Mathematics, University of the Witwatersrand, PO Wits, 2050 Johannesburg, South Africa (e-mail: arnold.knopfmacher@wits.ac.za)
STEPHAN WAGNER
Affiliation:
Department of Mathematical Sciences, Stellenbosch University, 7602 Stellenbosch, South Africa (e-mail: swagner@sun.ac.za)
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.

We consider statistical properties of random integer partitions. In order to compute means, variances and higher moments of various partition statistics, one often has to study generating functions of the form P(x)F(x), where P(x) is the generating function for the number of partitions. In this paper, we show how asymptotic expansions can be obtained in a quasi-automatic way from expansions of F(x) around x = 1, which parallels the classical singularity analysis of Flajolet and Odlyzko in many ways. Numerous examples from the literature, as well as some new statistics, are treated via this methodology. In addition, we show how to compute further terms in the asymptotic expansions of previously studied partition statistics.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2014