• Corpus ID: 231740991

The deranged Bell numbers

  title={The deranged Bell numbers},
  author={Hac{\`e}ne Belbachir and Yahia Djemmada and L'aszl'o N'emeth},
Abstract. It is known that the ordered Bell numbers count all the ordered partitions of the set [n] = {1, 2, . . . , n}. In this paper, we introduce the deranged Bell numbers that count the total number of deranged partitions of [n]. 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 r-versions. 

Tables from this paper


The r-Bell numbers
The notion of generalized Bell numbers was appeared in several works but there is no a systematic treatise on this topic. In this paper we fill this gap. We discuss the most important combinatorial,
The r-derangement numbers
This paper studies the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition, and finds exact formula, combinatorial relations, and analytic and asymptotic description for these numbers.
Commutation Relations, Normal Ordering, and Stirling Numbers
Introduction Set Partitions, Stirling, and Bell Numbers Commutation Relations and Operator Ordering Normal Ordering in the Weyl Algebra and Relatives Content of the Book Basic Tools Sequences Solving
Advanced Combinatorics: The Art of Finite and Infinite Expansions
I. Vocabulary of Combinatorial Analysis.- 1.1. Subsets of a Set Operations.- 1.2. Product Sets.- 1.3. Maps.- 1.4. Arrangements, Permutations.- 1.5. Combinations (without repetitions) or Blocks.- 1.6.
Combinatorial Identities for Stirling Numbers: The Unpublished Notes of H W Gould
This book is a unique work which provides an in-depth exploration into the mathematical expertise, philosophy, and knowledge of H W Gould. It is written in a style that is accessible to the reader
Enumerative combinatorics
This review of 3 Enumerative Combinatorics, by Charalambos A.good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations.
Analytic Combinatorics
This text can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study, and is certain to become the definitive reference on the topic.
Choice and Chance
WE should think that not a few copies of the first edition of this work must have been purchased under the impression that it was an interesting story; and it is surprising that so neat and
Extensions of Set Partitions and Permutations
Arithmetical and combinatorial properties of these sequences are established and extensions of a set partition obtained by imposing bounds on the size of the parts is examined.
Broder: The r-Stirling numbers
  • Discrete Math.,
  • 1984