# EMS Surveys in Mathematical Sciences

Full-Text PDF (603 KB) | Metadata | Table of Contents | EMSS summary

**Volume 4, Issue 2, 2017, pp. 101–184**

**DOI: 10.4171/EMSS/4-2-1**

Published online: 2017-11-13

Between primitive and 2-transitive: Synchronization and its friends

João Araújo^{[1]}, Peter J. Cameron

^{[2]}and Benjamin Steinberg

^{[3]}(1) University of Lisbon, Portugal

(2) University of St Andrews, UK

(3) City College of New York, USA

An automaton (consisting of a finite set of states with given transitions) is said to be synchronizing if there is a word in the transitions which sends all states of the automaton to a single state. Research on this topic has been driven by the *Černý conjecture*, one of the oldest and most famous problems
in automata theory, according to which a synchronizing $n$-state automaton has a reset word of length at most $(n-1)^2$.The transitions of an automaton generate a transformation monoid on the set of states, and so an automaton can be regarded as a transformation monoid with a prescribed set of generators. In this setting, an automaton is synchronizing if the transitions generate a constant map.

A permutation group $G$ on a set $\Omega$ is said to synchronize a map $f$ if the monoid $\langle G,f\rangle$ generated by $G$ and $f$ is synchronizing in the above sense; we say $G$ is synchronizing if it synchronizes every non-permutation.

The classes of synchronizing groups and friends form an hierarchy of natural and elegant classes of groups lying strictly between the classes of primitive and 2-homogeneous groups. These classes have been floating around for some years and it is now time to provide a unified reference on them.

The study of all these classes has been prompted by the Černý conjecture, but it is of independent interest since it involves a rich mix of group theory, combinatorics, graph endomorphisms, semigroup theory, finite geometry, and representation theory, and has interesting computational aspects as well. So as to make the paper self-contained, we have provided background material on these topics.

Our purpose here is to present recent work on synchronizing groups and related topics. In addition to the results that show the connections between the various areas of mathematics mentioned above, we include a new result on the Černý conjecture (a strengthening of a theorem of Rystsov), some challenges to finite geometers (which classical polar spaces can be partitioned into ovoids?), some thoughts about infinite analogues, and a long list of open problems to stimulate further work.

*Keywords: *Primitive groups, synchronizing groups, spreading groups, separating groups, Černý conjecture, ovoids and spreads, graphs, orbitals, transformation semigroups, automata, 2-transitive

Araújo João, Cameron Peter, Steinberg Benjamin: Between primitive and 2-transitive: Synchronization and its friends. *EMS Surv. Math. Sci.* 4 (2017), 101-184. doi: 10.4171/EMSS/4-2-1