Minimally intersecting set partitions of type B
The electronic journal of combinatorics, Tome 17 (2010)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXiv EuDML
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.
DOI :
10.37236/294
Classification :
05A18, 05A15, 05D05
Mots-clés : minimally intersecting set partitions, Dowling number, Dobinski's formula
Mots-clés : minimally intersecting set partitions, Dowling number, Dobinski's formula
William Y.C. Chen; David G.L. Wang. Minimally intersecting set partitions of type B. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/294
@article{10_37236_294,
author = {William Y.C. Chen and David G.L. Wang},
title = {Minimally intersecting set partitions of type {B}},
journal = {The electronic journal of combinatorics},
year = {2010},
volume = {17},
doi = {10.37236/294},
zbl = {1193.05023},
url = {http://geodesic.mathdoc.fr/articles/10.37236/294/}
}
Cité par Sources :