Papers
Topics
Authors
Recent
Search
2000 character limit reached

Boolean lattices in finite alternating and symmetric groups

Published 11 Nov 2019 in math.GR | (1911.04516v1)

Abstract: Given a group $G$ and a subgroup $H$, we let $\mathcal{O}G(H)$ denote the lattice of subgroups of $G$ containing $H$. This paper provides a classification of the subgroups $H$ of $G$ such that $\mathcal{O}{G}(H)$ is Boolean of rank at least $3$, when $G$ 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.