On groups with every normal subgroup transitive or semiregular.
A (finite) permutation group \(G\) is called `semiprimitive' iff every normal subgroup of \(G\) is transitive or semiregular. Clearly primitive, quasiprimitive or innately transitive permutation groups are semiprimitive, also finite Frobenius groups are semiprimitive. A transitive group \(G\) with a simple one-point-stabilizer is semiprimitive if and only if the one-point-stabilizer is not contained in a proper normal subgroup of \(G\) (Theorem 2.1). In the present paper several constructions of semiprimitive groups (also for infinite groups) are given and characterization theorems for (finite solvable) semiprimitive groups are proved. E.g. in Theorem 2.2 it is shown that a Coxeter system \((W,S)\) can be used to construct semiprimitive groups as factor groups of \(W\). If \(G\) is semiprimitive and solvable then \(G\) has a unique regular normal subgroup \(K\) -- the `kernel' of \(G\) -- such that every normal subgroup of \(G\) is contained in \(K\) or contains \(K\) (Theorem 3.1). If \(K\) is finite solvable and \(H\) acts on \(K\), then the semidirect product \(G=H\ltimes K\) has a semiprimitive action on the cosets of \(H\) in \(G\) iff \(H\) acts faithfully on every non-trivial \(H\)-invariant factor group of \(K\) (Theorem 3.2). There are further results about the normal structure of semiprimitive solvable groups and some reduction theorems allowing several constructions (Theorems 4.1, 4.2 and 4.3). Theorem 5.1 contains a classification of all solvable semiprimitive groups of degree \(n\) where \(n\) is a product of at most three primes or \(n\) is square-free. By work of \textit{P. P. Pálfy} and \textit{A. Szendrei} [in Contributions to general algebra 2, Proc. Klagenfurt Conf. 1982, 273-290 (1983; Zbl 0538.08006)] there are some motivating connections between the concept of semiprimitive groups and that of collapsing monoids in universal algebra; this aspect is discussed in the introduction and in Appendix A of the paper.
- A theory of semiprimitive groups
- Permutations which make transitive groups primitive.
- Primitive permutation groups with a solvable 2-transitive subconstituent.
- Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
- On Transitive Permutation Groups with Primitive Subconstituents
- An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
- Collapsing permutation groups.
- Finite permutation groups with a transitive minimal normal subgroup
- scientific article; zbMATH DE number 3855193 (Why is no real title available?)
- scientific article; zbMATH DE number 3972929 (Why is no real title available?)
- scientific article; zbMATH DE number 479556 (Why is no real title available?)
- scientific article; zbMATH DE number 682077 (Why is no real title available?)
- scientific article; zbMATH DE number 2162135 (Why is no real title available?)
- scientific article; zbMATH DE number 3237838 (Why is no real title available?)
- scientific article; zbMATH DE number 3266724 (Why is no real title available?)
- scientific article; zbMATH DE number 3286093 (Why is no real title available?)
- scientific article; zbMATH DE number 3294681 (Why is no real title available?)
- Simplicity condition for the fundamental ideal of the modular group algebra of a locally finite group
- Unary polynomials in algebras. I
- A theory of semiprimitive groups
- On locally semiprimitive graphs and a theorem of Weiss
- The distinguishing number of quasiprimitive and semiprimitive groups
- Vertex-transitive graphs with local action the symmetric group on ordered pairs
- Two local conditions on the vertex stabiliser of arc-transitive graphs and their effect on the Sylow subgroups
- A class of semiprimitive groups that are graph-restrictive
- On semiregular elements of solvable groups.
- Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph
- On graph-restrictive permutation groups
- Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
- Seminormal and subnormal subgroup lattices for transitive permutation groups
- On orders of automorphisms of vertex-transitive graphs
- On finite permutation groups of rank three
- Finite semiprimitive permutation groups of rank 3
- Resolute and symmetric mechanisms for two-sided matching problems
- An overview on vertex stabilizers in vertex-transitive graphs
This page was built for publication: On groups with every normal subgroup transitive or semiregular.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482076)