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

Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree

Photo by yanots from unsplash

Abstract In this paper, we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. These groups have recently been investigated in terms… Click to show full abstract

Abstract In this paper, we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. These groups have recently been investigated in terms of their abstract structure, in a similar way to the O'Nan–Scott Theorem for primitive groups. Our goal here is to explore aspects of such groups which may be useful in place of precise structural information. We give bounds on the order, base size, minimal degree, fixed point ratio, and chief length of an arbitrary finite semiprimitive group in terms of its degree. To establish these bounds, we study the structure of a finite semiprimitive group that induces the alternating or symmetric group on the set of orbits of an intransitive minimal normal subgroup.

Keywords: order base; base size; semiprimitive permutation; finite semiprimitive; permutation groups; size minimal

Journal Title: Proceedings of the Edinburgh Mathematical Society
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.