Finding the smallest set on which a group acts faithfully

combinatorics group-theory permutations computational-complexity

Solution 1:

See this MO answer for links to several important papers.

The main citation is: Johnson, D. L. "Minimal permutation representations of finite groups." Amer. J. Math. 93 (1971), 857-866.

Edit (10/30/13): Check the comment below for an entire book on this subject.

Related

The tangent space of a manifold at a point given as the kernel of the jacobian of a submersion
How much can we "cheat" and use vector knowledge in complex analysis?
Effect of pullback of differential forms on an ideal
Bingo Probability Problem
Properties of the internal language of the category of sheaves.
What is meant by "mathematical maturity"?
Understanding Elliptic Operators
What is a particle mathematically?
A functional relation which is satisfied by $\cos x$ and $\sin x$
On continuity of roots of a polynomial depending on a real parameter
Computing the last non-zero digit of ${1027 \choose 41}$?
Does the sequence $\sin(n!\pi^2)$ converge or diverge?