Given a finite group G, I'm interested to know the smallest size of a set X such that G acts faithfully on X. It's easy for abelian groups - decompose into cyclic groups of prime power order and add their sizes. And the non-abelian group of order pq (p, q primes, q = 1 mod p) embeds in the symmetric group of degree q as shown here: www.jstor.org/stable/2306479.


How much is known about this problem in general?



Smallest permutation representation of a finite group?
It is difficult to find this number for arbitrary finite groups, but many families have been solved. A somewhat early paper that has motivated a lot of work in this area is:


Johnson, D. L. "Minimal permutation representations of finite groups."
Amer. J. Math. 93 (1971), 857-866. [MR 316540](http://www.ams.org/mathscinet-getitem?mr=316540) [DOI: 10.2307/2373739](http://dx.doi.org/10.2307/2373739).


This paper classifies those groups for which the regular permutation representation is the minimal faithful permutation representation (cyclic of prime power order, K4, or generalized quaternion) and some results on nilpotent groups (improved in later papers).


The minimal permutation degrees of the finite simple groups are known from:


Cooperstein, Bruce N. "Minimal degree for a permutation representation of a classical group."
Israel J. Math. 30 (1978), no. 3, 213-235. [MR 506701](http://www.ams.org/mathscinet-getitem?mr=506701) [DOI: 10.1007/BF02761072](http://dx.doi.org/10.1007/BF02761072).


This paper only finds the degrees. A fuller description of the permutation representations are given in:


Grechkoseeva, M. A. "On minimal permutation representations of classical simple groups." Siberian Math. J. 44 (2003), no. 3, 443-462 [MR 1984704](http://www.ams.org/mathscinet-getitem?mr=1984704) [DOI: 10.1023/A:1023860730624](http://dx.doi.org/10.1023/A:1023860730624).


There are a great deal of topics associated with minimal permutation degrees. I'll just briefly sketch them below, let me know if any interest you and I can give citations or longer descriptions:


The minimal degree of a subgroup is never larger than the minimal degree of the parent group, but the minimal degree of a quotient group may be much, much larger than that of the original. This poses problems in computational group theory, since quotient groups may be difficult to represent. Some quotients are easy to represent, and this has had a significant impact on CGT in the last 10 years or so. 


Finding minimal permutation representations of covering groups can be difficult, and here I think the results are much less complete. Basically what you want are large subgroups not containing normal subgroups. In a covering group Z(G) is contained in really quite a few of the "good choices". This is because it is contained in Φ(G), the Frattini subgroup, the intersection of the maximal subgroups. One has to give up using maximal subgroups (at least if Z(G) is cyclic of prime power order), and so the minimal degree can increase dramatically.


Minimal degrees of primitive permutation groups is a topic with a different flavor (rather than specific families of groups, it is more of the interactions between group properties), but a great deal is known. Similar techniques are used to describe asymptotic behavior of minimal degrees of arbitrary families of finite groups, and quite powerful results are available there.


