Related papers: Synchronising primitive groups of diagonal type ex…

The synchronisation hierarchy of finite permutation groups consists of classes of groups lying between 2-transitive groups and primitive groups. This includes the class of spreading groups, which are defined in terms of sets and multisets…

The Hall--Paige conjecture asserts that a finite group has a complete mapping if and only if its Sylow subgroups are not cyclic. The conjecture is now proved, and one aim of this paper is to document the final step in the proof (for the…

We describe the methods and results of a classification of the non-synchronizing primitive permutation groups of degree up to 624. We make use of theory and computation to determine the primitive groups of degree up to 624 that are…

A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…

Let $G$ be a finite permutation group on $\Omega$. An ordered sequence of elements of $\Omega$, $(\omega_1,\dots, \omega_t)$, is an irredundant base for $G$ if the pointwise stabilizer $G_{(\omega_1,\dots, \omega_t)}$ is trivial and no…

Let $\Omega$ be a set of cardinality $n$, $G$ a permutation group on $\Omega$, and $f:\Omega\to\Omega$ a map which is not a permutation. We say that $G$ \emph{synchronizes} $f$ if the transformation semigroup $\langle G,f\rangle$ contains a…

Let $\mathcal D$ be a nontrivial symmetric $(v,k,\lambda)$ design, and $G$ be a subgroup of the full automorphism group of $\mathcal D$. In this paper we prove that if $G$ acts flag-transitively, point-primitively on $\mathcal D$ and…

The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. The contributions of Jordan and Marggraff to this topic are briefly…

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…

We establish the existence of maximal subgroups of various diferent natures in SL(n,Z). In particular, we prove that there are continuously many maximal subgroups, we provide a maximal subgroup whose action on the projective space has no…

It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree…

This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…

We give a new characterization of primitive permutation groups tied to the notion of completely reachable automata. Also, we introduce sync-maximal permutation groups tied to the state complexity of the set of synchronizing words of certain…

We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show…

In 2011, Penttila and Williford constructed an infinite new family of primitive $Q$-polynomial 3-class association schemes, not arising from distance regular graphs, by exploring the geometry of the lines of the unitary polar space…

In this short note we prove that the finite non-abelian simple groups PSL(2,q), where q = 5,7, are determined by their posets of classes of isomorphic subgroups. In particular, this disproves the conjecture in the end of [5].

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

In this paper we determine the classical simple groups of dimension r=3,5 which are (2,3)-generated (the cases r = 2, 4 are known). If r = 3, they are PSL_3(q), q <> 4, and PSU_3(q^2), q^2 <> 9, 25. If r = 5 they are PSL_5(q), for all q,…

We construct a sequence of primitive-stable representations of free groups into PSL(2,C) whose ranks go to infinity, but whose images are discrete with quotient manifolds that converge geometrically to a knot complement. In particular this…