# Simple groups, permutation groups, and probability

```@article{Liebeck1999SimpleGP,
title={Simple groups, permutation groups, and probability},
author={Martin W. Liebeck and Aner Shalev},
journal={Journal of the American Mathematical Society},
year={1999},
volume={12},
pages={497-520}
}```
• Published 1999
• Mathematics
• Journal of the American Mathematical Society
In recent years probabilistic methods have proved useful in the solution of several problems concerning finite groups, mainly involving simple groups and permutation groups. In some cases the probabilistic nature of the problem is apparent from its very formulation (see [KL], [GKS], [LiSh1]); but in other cases the use of probability, or counting, is not entirely anticipated by the nature of the problem (see [LiSh2], [GSSh]). In this paper we study a variety of problems in finite simple groups…
136 Citations
The concept of a base for a permutation group was introduced by Sims in the 1960s in connection with computational group theory. It has proved to be of theoretical importance as well. For example,
A base B for a finite permutation group G acting on a set Ω is a subset of Ω with the property that only the identity of G can fix every element of B. In this dissertation, we investigate some
It is well known that every ﬁnite simple group has a generating pair. Moreover, Guralnick and Kantor proved that every ﬁnite simple group has the stronger property, known as 32 -generation, that
The most important geometric invariant of a degree-n complex rational function f(X) is its monodromy group, which is a set of permutations of n objects. This monodromy group determines several
• Mathematics
• 2013
Let \$G\$ be a permutation group on a set \$\Omega\$. A subset of \$\Omega\$ is a base for \$G\$ if its pointwise stabilizer is trivial; the base size of \$G\$ is the minimal cardinality of a base. In this
In this thesis, we investigate the connection between finitely generated profinite groups G and the associated Dirichlet series PG(s) of which the reciprocal is called the probabilistic zeta function
• Mathematics
Israel Journal of Mathematics
• 2022
Let G be a finite non-regular primitive permutation group on a set Ω with point stabiliser Gα. Then G is said to be extremely primitive if Gα acts primitively on each of its orbits in Ω \ {α}, which
• Mathematics
Discret. Math. Theor. Comput. Sci.
• 2011
It is proved that, given permutation groups G, H \textless= Sym(Omega) such that G is an element of Gamma(d), the normalizer of H in G can be found in polynomial time.