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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “An Enumerative Problem in Threshold Logic”
The asymptotic number of set partitions with unequal block sizes.
Where the typical set partitions meet and join.
Pittel, Boris (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On noncrossing and nonnesting partitions for classical reflection groups.
Athanasiadis, Christos A. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Integer partitions with fixed subsums.
Yakubovich, Yu. (2005)
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:
A classification of the nilpotent triangular matrices
Wim H. Hesselink (1985)
Compositio Mathematica
Similarity:
Orthogonal partitions
Barbara Majcher-Iwanow (1990)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
A note on the exact expected length of the th part of a random partition.
Eriksson, Kimmo (2010)
Integers
Similarity:
-Carter partitions, their crystal-theoretic behavior and generating function.
Berg, Chris, Vazirani, Monica (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Combinatorics of partial derivatives.
Hardy, Michael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: