Files and links (1)
PDFOpen Access (License Unspecified), Open Access
Dissertation
Part-products of random integer compositions
Doctor of Philosophy (Ph.D.), Drexel University
Mar 2012
DOI:
https://doi.org/10.17918/etd-3855
Abstract
A composition of n is a sequence of positive integers, called parts, that sum to n. Given a set S of positive integers, we consider compositions chosen randomly from a uniform distribution on the set of all compositions of n with parts in S. Three progressively more difficult choices of S are considered: unrestricted compositions, where S = Z₊; 1-free compositions, where S = Z₊\{1}; and S-restricted compositions, where S is an arbitrary cofinite subset of Z₊. For each choice of S, we regard the product of the parts as a random variable. We begin by deriving formulas for the moments of both the part-product and its logarithm and then proceed to the more challenging problem of proving that the part-product is asymptotically lognormal. In the case of unrestricted compositions, the calculations are relatively easy to complete using classical methods. However, those methods break down for the remaining two choices of S. We therefore introduce and formalize two new techniques for studying random compositions, the "embedding" technique and the "blocking" technique, which lead to proofs of the asymptotic lognormality of the product of parts for 1-free and S-restricted compositions respectively.
Metrics
29 File views/ downloads
25 Record Views
Details
- Title
- Part-products of random integer compositions
- Creators
- Caroline J. Shapcott - DU
- Contributors
- Eric J. Schmutz (Advisor) - Drexel University (1970-)
- Awarding Institution
- Drexel University
- Degree Awarded
- Doctor of Philosophy (Ph.D.)
- Publisher
- Drexel University; Philadelphia, Pennsylvania
- Resource Type
- Dissertation
- Language
- English
- Academic Unit
- College of Arts and Sciences; Drexel University; Mathematics
- Other Identifier
- 3855; 991014632384404721