Probabilistic methods for obtaining asymptotic formulas for generalized Stirling numbers

DOI10.1007/BF02368751zbMath1307.05007MaRDI QIDQ1947761

E. G. Tsylova

Publication date: 26 April 2013

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Factorials, binomial coefficients, combinatorial functions (05A10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (4)

Explicit estimates for Comtet numbers of the first kind ⋮ Using probabilistic models to study the asymptotic behavior of Bell numbers ⋮ Explicit upper bounds for the Stirling numbers of the first kind ⋮ On random partitions induced by random maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-central Stirling numbers and some applications
• Solution by the establishment method of boundary value problems on eigenvalues
• Some Multidimensional Theorems on a Classical Problem of Permutations
• An Asymptotic Formula for the Differences of the Powers at Zero

This page was built for publication: Probabilistic methods for obtaining asymptotic formulas for generalized Stirling numbers