D. Stark
Research Subjects
Research Interests
D. Stark has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Andrew M. Odlyzko
AT&T Labs – Research , 180 Park Avenue, Florham Park , NJ , 07932 , United States
1 shared publication - Arnold Knopfmacher
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
1 shared publication - Boris Pittel
The Ohio State University
1 shared publication - George Szekeres
School of Mathematics, University of New South Wales , Sydney , 2052 , Australia
1 shared publication - L. Bruce Richmond
Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
1 shared publication - Nicholas C. Wormald
Department of Mathematics, University of Melbourne, Parkville, Vic 3052, Australia
1 shared publication
Latest Publications
- Open Access
- 21 October 1998
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 6 (1) , R2
The Asymptotic Number of Set Partitions with Unequal Block Sizes
The asymptotic behavior of the number of set partitions of an $n$-element set into blocks of distinct sizes is determined. This behavior is more complicated than is typical for set partition problems. Although there is a simple generating function, the usual analytic methods for estimating coefficients fail in the direct approach, and elementary approaches combined with some analytic methods are used to obtain most of the results. Simultaneously, we obtain results on the shape of a random partition of an $n$-element set into blocks of distinct sizes.
- 21 October 1998
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 6 (1) , R2
Open AccessThe Asymptotic Number of Set Partitions with Unequal Block Sizes
The asymptotic behavior of the number of set partitions of an $n$-element set into blocks of distinct sizes is determined. This behavior is more complicated than is typical for set partition problems. Although there is a simple generating function, the usual analytic methods for estimating coefficients fail in the direct approach, and elementary approaches combined with some analytic methods are used to obtain most of the results. Simultaneously, we obtain results on the shape of a random partition of an $n$-element set into blocks of distinct sizes.