Where the typical set partitions meet and join.

Pittel, Boris

The search session has expired. Please query the service again.

Displaying similar documents to “Where the typical set partitions meet and join.”

The asymptotic number of set partitions with unequal block sizes.

Knopfmacher, A., Odlyzko, A.M., Pittel, B., Richmond, L.B., Stark, D., Szekeres, G., Wormald, N.C. (1999)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Durfee polynomials.

Canfield, E.Rodney, Corteel, Sylvie, Savage, Carla D. (1998)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Common summands in partitions

Hang-Fai Yeung (1992)

Acta Arithmetica

Similarity:

On practical partitions.

P. Erdös, J. L. Nicolas (1995)

Collectanea Mathematica

Similarity:

Combinatorics of partial derivatives.

Hardy, Michael (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Records in set partitions.

Knopfmacher, Arnold, Mansour, Toufik, Wagner, Stephan (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On colored set partitions of type B n

David Wang (2014)

Open Mathematics

Similarity:

Generalizing Reiner’s notion of set partitions of type B n, we define colored B n-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored B n-partitions, we get the exact formulas for the expectation and variance of the number of non-zero-blocks in a random colored B n-partition. We find an asymptotic expression of the total number of colored B n-partitions up to an error of O(n −1/2log7/2 n], and prove that the centralized...

A note on the exact expected length of the $k$ th part of a random partition.

Eriksson, Kimmo (2010)

Integers

Similarity:

Analysis of an algorithm to construct Fibonacci partitions

Helmut Prodinger (1984)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Sets, lists and noncrossing partitions.

Callan, David (2008)

Journal of Integer Sequences [electronic only]

Similarity:

Symmetric partitions and pairings

Ferenc Oravecz (2000)

Colloquium Mathematicae

Similarity:

The lattice of partitions and the sublattice of non-crossing partitions of a finite set are important objects in combinatorics. In this paper another sublattice of the partitions is investigated, which is formed by the symmetric partitions. The measure whose nth moment is given by the number of non-crossing symmetric partitions of n elements is determined explicitly to be the "symmetric" analogue of the free Poisson law.