Hostname: page-component-848d4c4894-xfwgj Total loading time: 0 Render date: 2024-06-17T20:10:22.660Z Has data issue: false hasContentIssue false

A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures

Published online by Cambridge University Press:  01 March 1998

HSIEN-KUEI HWANG
Affiliation:
Institute of Statistical Science, Academia Sinica, Taipei 11529, Taiwan (e-mail: hkhwang@stat.sinica.edu.tw)

Abstract

Given a class of combinatorial structures [Cscr ], we consider the quantity N(n, m), the number of multiset constructions [Pscr ] (of [Cscr ]) of size n having exactly m [Cscr ]-components. Under general analytic conditions on the generating function of [Cscr ], we derive precise asymptotic estimates for N(n, m), as n→∞ and m varies through all possible values (in general 1[les ]m[les ]n). In particular, we show that the number of [Cscr ]-components in a random (assuming a uniform probability measure) [Pscr ]-structure of size n obeys asymptotically a convolution law of the Poisson and the geometric distributions. Applications of the results include random mapping patterns, polynomials in finite fields, parameters in additive arithmetical semigroups, etc. This work develops the ‘additive’ counterpart of our previous work on the distribution of the number of prime factors of an integer [20].

Type
Research Article
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)