Tag Archives: permutation groups


12160 is an interesting number; but I didn’t know that until last night. As part of the work on semigroups, we are looking at the following problem. Given n and k, with n ≥ 2k, suppose that G is a k-homogeneous subgroup … Continue reading

Posted in doing mathematics, exposition | Tagged , , | 3 Comments

Permutation groups and transformation semigroups

When I first decided to apply to the LMS to run a Durham symposium on Permutation Groups and Transformation Semigroups, I had a fairly clear idea of what I wanted: topics (both finite and infinite) where the techniques and results … Continue reading

Posted in Uncategorized | Tagged , , , , , , , , , | Leave a comment

Real v recreational mathematics

A footnote to my report on Persi Diaconis’ lecture on Martin Gardner. Persi challenged us to consider the question: Is there a sharp division between “real” mathematics and “recreational” mathematics, and if so, where does it come? G. H. Hardy clearly thought … Continue reading

Posted in 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

A permutation group challenge, 2

The result in the preceding post can be formulated as follows: A permutation group of degree n = 2k which is transitive on partitions of shape (k,k) but not on ordered partitions of this shape, has a fixed point and is (k−1)-homogeneous … Continue reading

Posted in open problems | Tagged , , | 1 Comment

A permutation group challenge

Long ago, in the distant past before the Classification of Finite Simple Groups, Peter Neumann, Jan Saxl and I investigated the class of permutation groups acting on sets of even cardinality n = 2k, with the following interchange property: Any subset of … Continue reading

Posted in exposition, open problems | Tagged , , , | 1 Comment

Synchronizing coherent configurations

In previous posts I have discussed coherent configurations and synchronization. Yesterday I realised that these two topics can be combined … Synchronization A (finite-state, deterministic) automaton consists of a finite set of states and a finite set of transitions, each … Continue reading

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