On solvable minimally transitive permutation groups.

DOI10.1007/S10623-007-9078-1MaRDI QIDQ2384036zbMATH OpenOpenAlexFDO

Authors Francesca Dalla Volta, Johannes Siemons

Publication date 20 September 2007

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0702194, https://ueaeprints.uea.ac.uk/id/eprint/21028/1/On_solvable_minimally_transitive_permutation_groups-2007.pdf

zbMATH Keywords

finite transitive permutation groupsminimal transitivitysolvable permutation groups

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Multiply transitive finite groups (20B20) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Finite nilpotent groups, (p)-groups (20D15)

Abstract: We investigate properties of finite transitive permutation groups $(G,Omega)$ in which all proper subgroups of $G$ act intransitively on $Omega.$ In particular, we are interested in reduction theorems for minimally transitive representations of solvable groups.

Review text

The authors investigate properties of finite transitive permutation groups \((G,\Omega)\) in which all proper subgroups of \(G\) act intransitively on \(\Omega\). In particular they consider solvable groups and study more generally minimally transitive representations which may or may not be faithful. Any transitive group contains minimally transitive subgroups and therefore it would be unreasonable to expect full classifications in general, but under suitable restrictions some general results can be obtained. For instance, a simple description is given of the minimally transitive representations of nilpotent groups. For faithful action the primes dividing the order of a solvable group must divide the degree. The authors are interested in reduction theorems, for example they prove a general splitting principle reducing representations of non-nilpotent groups to representations of subgroups, generally involving fewer primes. A good result is also obtained for actions of square-free degree extending the work of Suprunenko and Kopylova, who studied the groups of degree \(pq\) with \(p\) and \(q\) primes.

Recommendations

• scientific article; zbMATH DE number 4107069
• scientific article; zbMATH DE number 1140700
• Generating minimally transitive permutation groups.
• Finite permutation groups with a transitive minimal normal subgroup
• scientific article; zbMATH DE number 3987535

Cites work

• scientific article; zbMATH DE number 475365 (Why is no real title available?)
• scientific article; zbMATH DE number 1140700 (Why is no real title available?)
• Non-Cayley vertex-transitive graphs of order twice the product of two odd primes
• On Transitive Permutation Groups

Cited in

(8)

• Minimal generation of transitive permutation groups
• Permutation groups of prime degree, a quick proof of Burnside's theorem.
• Generating minimally transitive permutation groups.
• Transitive permutation groups with representations of bounded degree
• scientific article; zbMATH DE number 3939567 (Why is no real title available?)
• scientific article; zbMATH DE number 3987535 (Why is no real title available?)
• scientific article; zbMATH DE number 4107069 (Why is no real title available?)
• Finite permutation groups with a transitive minimal normal subgroup

This page was built for publication: On solvable minimally transitive permutation groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384036)