Minimally Intersecting Set Partitions of Type $B$
William Y. C. Chen, David G. L. Wang · The Electronic Journal of Combinatorics · 2010
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2010
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.
Open the resolved locator · 10.37236/294
Metadata licence: OpenAlex metadata (CC0)