Minimally Intersecting Set Partitions of Type $B$

  • William Y.C. Chen
  • David G.L. Wang
DOI: https://doi.org/10.37236/294

Abstract

Motivated by Pittel's study of minimally intersecting set partitions, we investigate minimally intersecting set partitions of type $B$. Our main result is a formula for the number of minimally intersecting $r$-tuples of $B_n$-partitions. As a consequence, it implies the formula of Benoumhani for the Dowling number in analogy to Dobiński's formula.

Published
2010-01-31
How to Cite
Chen, W. Y., & Wang, D. G. (2010). Minimally Intersecting Set Partitions of Type $B$. The Electronic Journal of Combinatorics, 17(1), R22. https://doi.org/10.37236/294
Issue
Volume 17 (2010)
Article Number
R22