Minimally Intersecting Set Partitions of Type B

2009/10/06 by William Y. C. Chen, David G. L. Wang, Chen, William Y. C. +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.0910.0905

16 pages

arxiv created 2009/10/06 · arxiv updated 2009/12/01

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 B_n-partitions, as well as a formula for the number of minimally intersecting r-tuples of B_n-partitions without zero-block. As a consequence, it follows the formula of Benoumhani for the Dowling number in analogy to Dobinski's formula.

Related

• The maximum intersection number of regular simplicial partitions
• An Analogue of Hilton-Milner Theorem for Set Partitions
• Erdős-Ko-Rado theorem and Hilton-Milner type theorem for k-partitions
• On Singletons and Adjacencies of Set Partitions of Type B
• Combinatorial Proof of the Minimal Excludant Theorem