Tag Archives: base size

A thrifty algorithm

Posted on 20/01/2013 by

Two important classical parameters of a permutation group G of degree n are the base size, the smallest size of a collection of points whose pointwise stabiliser is the identity; and the minimal degree, the smallest number of points moved … Continue reading →

Posted in exposition, open problems | Tagged , , , , , | 4 Comments