Statistics on Ordered Partitions of Sets and q-Stirling Numbers

Details Statistics on Ordered Partitions of Sets and q-Stirling Numbers Statistics on Ordered Partitions of Sets and q-Stirling Numbers

2006-05-15

arxiv.org/abs/math/0605390v2

Mathematics

Combinatorics

29 pages

Scientific paper

An ordered partition of [n]:={1,2,..., n} is a sequence of its disjoint subsets whose union is [n]. The number of ordered partitions of [n] with k blocks is k!S(n,k), where S(n,k) is the Stirling number of second kind. In this paper we prove some refinements of this formula by showing that the generating function of some statistics on the set of ordered partitions of [n] with k blocks is a natural $q$-analogue of k!S(n,k). In particular, we prove several conjectures of Steingr\'{\i}msson. To this end, we construct a mapping from ordered partitions to walks in some digraphs and then, thanks to transfer-matrix method, we determine the corresponding generating functions by determinantal computations.

Affiliated with

Also associated with

No associations

Rating

Statistics on Ordered Partitions of Sets and q-Stirling Numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Statistics on Ordered Partitions of Sets and q-Stirling Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Statistics on Ordered Partitions of Sets and q-Stirling Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-621631