Minimally Intersecting Set Partitions of Type B
Combinatorics
2009-10-07 v1
Abstract
Motivated by Pittel's study of minimally intersecting set partitions, we investigate minimally intersecting set partitions of type B. We find a formula for the number of minimally intersecting r-tuples of -partitions, as well as a formula for the number of minimally intersecting r-tuples of -partitions without zero-block. As a consequence, it follows the formula of Benoumhani for the Dowling number in analogy to Dobinski's formula.
Keywords
Cite
@article{arxiv.0910.0905,
title = {Minimally Intersecting Set Partitions of Type B},
author = {William Y. C. Chen and David G. L. Wang},
journal= {arXiv preprint arXiv:0910.0905},
year = {2009}
}
Comments
16 pages