Permutations contained in transitive subgroups

From MaRDI portal



Abstract: In the first paper in this series we estimated the probability that a random permutation piinmathcalSn has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that pi has m disjoint fixed sets of prescribed sizes k1,dots,km, where k1+cdots+km=n. We deduce an estimate for the proportion of permutations contained in a transitive subgroup other than mathcalSn or mathcalAn. This theorem consists of two parts: an estimate for the proportion of permutations contained in an imprimitive transitive subgroup, and an estimate for the proportion of permutations contained in a primitive subgroup other than mathcalSn or mathcalAn.











This page was built for publication: Permutations contained in transitive subgroups

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