Minimally intersecting set partitions of type B
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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
@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/}
}
TY  - JOUR
AU  - William Y.C. Chen
AU  - David G.L. Wang
TI  - Minimally intersecting set partitions of type B
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/294/
DO  - 10.37236/294
ID  - 10_37236_294
ER  - 
%0 Journal Article
%A William Y.C. Chen
%A David G.L. Wang
%T Minimally intersecting set partitions of type B
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/294/
%R 10.37236/294
%F 10_37236_294
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

Cité par Sources :