LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group

Photo from wikipedia

Abstract We show that there exists a constant a such that, for every subgroup H of a finite group G, the number of maximal subgroups of G containing H is… Click to show full abstract

Abstract We show that there exists a constant a such that, for every subgroup H of a finite group G, the number of maximal subgroups of G containing H is bounded above by a|G:H|3/2{a\lvert G:H\rvert^{3/2}}. In particular, a transitive permutation group of degree n has at most a⁢n3/2{an^{3/2}} maximal systems of imprimitivity. When G is soluble, generalizing a classic result of Tim Wall, we prove a much stronger bound, that is, the number of maximal subgroups of G containing H is at most |G:H|-1{\lvert G:H\rvert-1}.

Keywords: maximal systems; group; permutation group; number maximal; transitive permutation

Journal Title: Forum Mathematicum
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.