Restricted r-Stirling numbers and their combinatorial applications

Abstract

We study set partitions with r distinguished elements and block sizes found in an arbitrary index set S. The enumeration of these (S, r)-partitions leads to the introduction of (S, r)-Stirling numbers, an extremely wide-ranging generalization of the classical Stirling numbers and the r-Stirling numbers. We also introduce the associated (S, r)-Bell and (S, r)-factorial numbers. We study fundamental aspects of these numbers, including recurrence relations and determinantal expressions. For S with some extra structure, we show that the inverse of the (S, r)-Stirling matrix encodes the Möbius functions of two families of posets. Through several examples, we demonstrate that for some S the matrices and their inverses involve the enumeration sequences of several combinatorial objects. Further, we highlight how the (S, r)-Stirling numbers naturally arise in the enumeration of cliques and acyclic orientations of special graphs, underlining their ubiquity and importance. Finally, we introduce related (S, r) generalizations of the poly-Bernoulli and poly-Cauchy numbers, uniting many past works on generalized combinatorial sequences.

Families of Integral Cographs within a Triangular Array

“…In other words, the graph Θw is integral if and only if w = t + . Recently, Beáta et al [3] have shown a combinatorial…”

Associated r-Dowling numbers and some relatives

“…If we require each block/cycle/ordered block (not only the non-distinguished ones) to contain at least s elements, then we call them n, m, r , D A ≥s, * n, m, r , DL ≥ s, * n, m, r , respectively. Alternative s-associated r -Bell numbers appear in two recent papers [1,3] (the former one allows a more general restriction on the cardinality of the blocks), while in [19,24], the authors investigated alternative 2-associated and alternative s-associated r -factorials under the names of r -derangement and generalized r -derangement numbers.…”

“…Again, B ≥ 1 n, r = B n, r . After the completion of this article, we have learnt about two very recent papers [1,3] which deal with associated r -Bell numbers, but in an alternative way, see the closing section of the present paper about alternative definitions. Now, we turn our attention to the "Bell-like numbers of the first kind", the permutational variants of the above numbers.…”

Vector weighted Stirling numbers and an application in graph theory

“…Choi and Smith [5] considered r-restricted Stirling numbers of the second kind and those partitions that each block contains at most r members. To see other researches on the generalization of Stirling numbers, we refer the reader to [13,14,9,7,2,1,15,11].…”