Boolean lattices in finite alternating and symmetric groups
Group Theory
2020-11-18 v1
Abstract
Given a group and a subgroup , we let denote the lattice of subgroups of containing . This paper provides a classification of the subgroups of such that is Boolean of rank at least , when is a finite alternating or symmetric group. Besides some sporadic examples and some twisted versions, there are two different types of such lattices. One type arises by taking stabilizers of chains of regular partitions, and the other type arises by taking stabilizers of chains of regular product structures. As an application, we prove in this case a conjecture on Boolean overgroup lattices, related to the dual Ore's theorem and to a problem of Kenneth Brown.
Cite
@article{arxiv.1911.04516,
title = {Boolean lattices in finite alternating and symmetric groups},
author = {Andrea Lucchini and Mariapia Moscatiello and Sebastien Palcoux and Pablo Spiga},
journal= {arXiv preprint arXiv:1911.04516},
year = {2020}
}
Comments
25 pages, classification of Boolean lattices in symmetric and alternating groups