Tag Archives: base size

Asymptotic group theory, 1

The conference opened with a talk by Yoav Segev on his construction, with Eliahu Rips and Katrin Tent, of infinite non-split sharply 2-transitive groups. A permutation group is sharply 2-transitive if any pair of distinct elements of the domain can … Continue reading

Posted in events, exposition | Tagged , , , , | Leave a comment

A thrifty algorithm

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