Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424104 | European Journal of Combinatorics | 2016 | 11 Pages |
Abstract
We prove that the generating polynomials of partitions of an n-element set into non-singleton blocks, counted by the number of blocks, have real roots only and we study the asymptotic behavior of the leftmost roots. We apply this information to find the most likely number of blocks. Also, we present a quick way to prove the corresponding statement for cycles of permutations in which each cycle is longer than a given integer r.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Miklós Bóna, István MezÅ,