Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T12:09:36.154Z Has data issue: false hasContentIssue false

Boolean lattices in finite alternating and symmetric groups

Published online by Cambridge University Press:  13 November 2020

Andrea Lucchini
Affiliation:
Dipartimento di Matematica “Tullio Levi-Civita”, University of Padova, Via Trieste 53, 35121 Padova, Italy; E-mail: lucchini@math.unipd.it
Mariapia Moscatiello
Affiliation:
Dipartimento di Matematica “Tullio Levi-Civita”, University of Padova, Via Trieste 53, 35121 Padova, Italy; E-mail: mariapia.moscatiello@math.unipd.it
Sebastien Palcoux
Affiliation:
Yau Mathematical Sciences Center, Tsinghua University, Beijing, China; E-mail: sebastien.palcoux@gmail.com
Pablo Spiga
Affiliation:
Dipartimento di Matematica e Applicazioni, University of Milano-Bicocca, Via Cozzi 55, 20125 Milano, Italy; E-mail: pablo.spiga@unimib.it

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Given a group G and a subgroup H, we let $\mathcal {O}_G(H)$ denote the lattice of subgroups of G containing H. This article 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 stabilisers of chains of regular partitions, and the other arises by taking stabilisers 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.

Information

Type
Algebra
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2020. Published by Cambridge University Press