Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4654121 | European Journal of Combinatorics | 2010 | 16 Pages |
Abstract
This paper introduces two statistics on set partitions, namely connector and circular connector . If B1/…/BkB1/…/Bk is a partition of {1,…,n}{1,…,n} with k>1k>1 blocks, then a connector is an ordered pair (c,c+1)(c,c+1) satisfying c∈Bi,c+1∈Bi+1,i=1,…,n−1. A circular connector is a connector when the blocks of a partition are arranged on a circle. We concentrate on the enumeration of partitions according to the two statistics, and certain variations thereof. Our results include several nice generating functions and explicit formulas. We also establish connections between connected partitions and words over a finite alphabet, and random walks on a square lattice.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Toufik Mansour, Augustine O. Munagi,