Intransitive Cartesian decompositions preserved by innately transitive permutation groups
classification
🧮 math.GR
keywords
groupsinnatelytransitivecartesiandecompositionsorbitspermutationproduct
read the original abstract
We study Cartesian decompositions of sets that are acted upon intransitively by innately transitive permutation groups. We prove that such groups have at most three orbits on such a decomposition. A consequence of this result is that if $G$ is an innately transitive subgroup of a wreath product in product action then the natural projection of $G$ into the top group has at most 2 orbits.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.