On Boolean sublattices of finite partition lattices

We investigate maximal Boolean sublattices of the partition lattice Part(U) of a finite universe U.

First, any largest size Boolean sublattice of Part(U) can be formed using all partitions whose blocks are subtrees of a tree with vertex set U.

It is shown that a maximal Boolean sublattice of Part(U) always contains the least and the largest elements of Part(U).

Boolean sublattices B of PartU containing 0 are characterized by a certain condition imposed on the cycles of a linear hypergraph corresponding to the atoms of B on the set U.

We show that B can be extended to a Boolean sublattice of Part(U) with a largest size, if and only if the hypergraph induced by its atoms is a hypertree.

This is the case when B is formed by all the partitions whose blocks are intervals in a generalized sense.

The main result states that all partition lattices of height at least three have maximal Boolean sublattices for all possible dimensions at least three