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:
Displaying similar documents to “Durfee polynomials.”
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:
Product partitions and recursion formulae.
Subbarao, M.V. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On a certain analogy of Stirling's numbers of the 2nd kind
Robert Karpe (1973)
Archivum Mathematicum
Similarity:
Combinatorics of partial derivatives.
Hardy, Michael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dominance order and graphical partitions.
Kohnert, Axel (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extending a recent result of Santos on partitions into odd parts.
Sellers, James A. (2003)
Integers
Similarity:
Maximum product over partitions into distinct parts.
Došlić, Tomislav (2005)
Journal of Integer Sequences [electronic only]
Similarity:
Franklin's argument proves an identity of Zagier.
Chapman, Robin (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Analysis of an algorithm to construct Fibonacci partitions
Helmut Prodinger (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Partitions excluding specific polygonal numbers as parts.
Sellers, James A. (2004)
Journal of Integer Sequences [electronic only]
Similarity: