Related papers: Primitive groups and synchronization

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabiliser in $G$ is trivial. In this paper we introduce and study an associated graph $\Sigma(G)$, which we call the Saxl graph of…

We characterise the primitive 2-closed groups $G$ of rank at most four that are not the automorphism group of a graph or digraph and show that if the degree is at least 2402 then there are just two infinite families or $G\leqslant…

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…

The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of…

Every synchronising permutation group is primitive and of one of three types: affine, almost simple, or diagonal. We exhibit the first known example of a synchronising diagonal type group. More precisely, we show that…

A finite non-regular primitive permutation group $G$ is extremely primitive if a point stabiliser acts primitively on each of its nontrivial orbits. Such groups have been studied for almost a century, finding various applications. The…

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

We introduce the Hermitian-invariant group $\Gamma_f$ of a proper rational map $f$ between the unit ball in complex Euclidean space and a generalized ball in a space of typically higher dimension. We use properties of the groups to define…

If $G$ is a group acting on a set $\Omega$ and $\alpha, \beta \in \Omega$, the digraph whose vertex set is $\Omega$ and whose arc set is the orbit $(\alpha, \beta)^G$ is called an {\em orbital digraph} of $G$. Each orbit of the stabiliser…

The problem of synchronization over a group $\mathcal{G}$ aims to estimate a collection of group elements $G^*_1, \dots, G^*_n \in \mathcal{G}$ based on noisy observations of a subset of all pairwise ratios of the form $G^*_i {G^*_j}^{-1}$.…

We study an infinite family of one-parameter deformations, so-called $\alpha$-continued fractions, of interval maps associated to distinct triangle Fuchsian groups. In general for such one-parameter deformations, the function giving the…

In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let $G \leqslant \mathrm{Sym}(\Omega)$ be a transitive permutation group, and ${S}$ an intersecting set. Previous results show that if $G$ is…

We exhibit new conditions under which a primitive automaton is synchronizing. In particular, we show that the primitivity of an automaton forces its synchronizability whenever the automaton has either a letter of defect 1 or a word of rank…

In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permutations on the set of states, and they are not synchronizing…

Let $X$ be a finite set such that $|X|=n$, and let $k< n/2$. A group is $k$-homogeneous if it has only one orbit on the sets of size $k$. The aim of this paper is to prove some general results on permutation groups and then apply them to…

Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…

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…

A transformation monoid on a set Omega is called synchronizing if it contains an element of rank 1 (that is, mapping the whole of Omega to a single point). In this paper, I tackle the question: given n and k, what is the probability that…

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…