The deranged Bell numbers
From MaRDI portal
Abstract: It is known that the ordered Bell numbers count all the ordered partitions of the set . In this paper, we introduce the deranged Bell numbers that count the total number of deranged partitions of . We first study the classical properties of these numbers (generating function, explicit formula, convolutions, etc.), we then present an asymptotic behavior of the deranged Bell numbers. Finally, we give some brief results for their -versions.
Recommendations
Cites work
- A Function Related to the Series for
- Analytic combinatorics
- Closed forms for derangement numbers in terms of the Hessenberg determinants
- Combinatorics of permutations
- Commutation relations, normal ordering, and Stirling numbers
- Extensions of set partitions and permutations
- scientific article; zbMATH DE number 1774199 (Why is no real title available?)
- On a closed form for derangement numbers: an elementary proof
- On Some Numbers Related to the Bell Numbers
- Preferential Arrangements
- Some Probabilistic Aspects of Set Partitions
- The r-Bell numbers
- The \(r\)-derangement numbers
- The \(r\)-Stirling numbers
- The Number of Partitions of a Set
Cited in
(2)
This page was built for publication: The deranged Bell numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175357)