Logo image
Back
A local limit theorem in the theory of overpartitions
Journal article   Open access   Peer reviewed

A local limit theorem in the theory of overpartitions

Sylvie Corteel, William M.Y. Goh and Pawel Hitczenko
Algorithmica, v 46(3-4), pp 329-343
01 Nov 2006
DOI: https://doi.org/10.1007/s00453-006-0102-z
pdf
A Local Limit Theorem in the Theory of Overpartitions215.45 kBDownloadView
PDF Open Access Open Access (License Unspecified)

Abstract

Asymptotic analysis Combinatorial probability Local limit theorem Partitions
An overpartition of an integer n is a partition where the last occurrence of a part can be overlined. We study the weight of the overlined parts of an overpartition counted with or without their multiplicities. This is a continuation of a work by Corteel and Hitczenko whereit was shown that the expected weight of the overlined partsis asymptotic to n/3 as n 薔 ∞ and that the expected weight of the overlined parts counted with multiplicity is n/2. Here we refine these results. We first compute the asymptotics of the variance of the weight of the overlined parts counted with multiplicity. We then asymptotically evaluate the probability that the weight of the overlined parts is n/3 ± k for k = o(n) and the probability that the weight of the overlined parts counted with multiplicity is n/2 ± k for k = o(n). The first computation is straightforward and uses known asymptotics of partitions. The second one is more involved and requires a sieve argument and the application of the saddle-point method. From that we can directly evaluate the probability that two random partitions of n do not share a part.

Metrics

5 File views/ downloads
13 Record Views
7 citations in Web of Science
7 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
International collaboration
Web of Science research areas
Computer Science, Software Engineering
Mathematics, Applied
Logo image