کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4653553 | 1632777 | 2014 | 10 صفحه PDF | دانلود رایگان |
We consider the enumeration of partitions of a finite set according to the number of consecutive elements inside a block under the assumption that the elements are arranged around a circle. This statistic, commonly known as circular succession, continues to play a significant role in many combinatorial problems involving combinations of a set following its first appearance in a paper of Irving Kaplansky in the 1940s. In this paper we obtain interesting formulas for the number of partitions avoiding a circular succession and the number of partitions containing a specified number of circular successions. Our methods include both elementary combinatorial reasoning and the application of ordinary and exponential power series generating functions. Several new combinatorial identities are also stated.
Journal: European Journal of Combinatorics - Volume 42, November 2014, Pages 207–216