Mixed r-stirling numbers of the second kind
Abstract
The Stirling number of the second kind n k counts the number of ways to partition a set of n labeled balls into k non-empty unlabeled cells. As an extension of this, we consider b1+b2+…+bn balls with b1 balls labeled 1, b2 balls labeled 2, …, bn balls labeled n and c1+c2+…+ck cells with c1 cells labeled 1, c2 cells labeled 2, …, ck cells labeled k and then we called the number of ways to partition the set of these balls into non-empty cells of these types as the mixed partition numbers. As an application, we give a new statement of the r-Stirling numbers of second kind and r-Bell numbers. We also introduce the r-mixed Stirling number of second kind and r-mixed Bell numbers. Finally, for a positive integer m we evaluate the number of ways to write m as the form m1· m2·…· mk, where k≥slant 1 and mi's are positive integers greater than 1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.