An asymptotic formula for the number of classes of sets of n indistinguishable elements
From MaRDI portal
Publication:1217128
DOI10.1016/0097-3165(75)90095-3zbMath0305.05008OpenAlexW2046722533MaRDI QIDQ1217128
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(75)90095-3
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Other combinatorial set theory (03E05)
Related Items (2)
Cites Work
This page was built for publication: An asymptotic formula for the number of classes of sets of n indistinguishable elements