Recounting Relations for Set Partitions with Restrictions

Abstract

We provide combinatorial arguments of some relations between classical Stirling numbers of the second kind and two refinements of these numbers gotten by introducing restrictions to the distances among the elements in each block of a finite set partition.