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 $\mathrm{PSL}(2,q)\times \mathrm{PSL}(2,q)$ acting in its diagonal action on $\mathrm{PSL}(2,q)$ is separating, and hence synchronising, for $q=13$ and $q=17$. Furthermore, we show that such groups are non-spreading for all prime powers $q$
The second author was supported by the Fundação para a Ciência e Tecnologia (Portuguese Foundation f...
AbstractPin showed that every p-state automaton (p a prime) containing a cyclic permutation and a no...
A transitive permutation group G on a finite set Omega is said to be pre-primitive if every G-invari...
The Hall–Paige conjecture asserts that a finite group has a complete mapping if and only if its Sylo...
The Hall-Paige conjecture asserts that a finite group has a complete mapping if and only if its Sylo...
2022 Spring.Includes bibliographical references.The class of permutation groups includes 2-homogeneo...
About 15 years ago, Araújo, Arnold and Steinberg introduced the notion of synchronisation to the the...
An automaton (consisting of a finite set of states with given transitions) is said to be synchronizi...
Let Ω be a set of cardinality n, G a permutation group on Ω, and f : Ω → Ω a map which is not a perm...
iAbstract The synchronization property emerged from finite state automata and transformation semigro...
An automaton is said to be synchronizing if there is a word in the transitions which sends all state...
Suppose that a deterministic finite automata A = (Q ,Σ) is such that all but one letters from the a...
© 2016 London Mathematical Society. Let Ω be a set of cardinality n, G be a permutation group on Ω a...
The primitive finite permutation groups containing a cycle are classified. Of these, only the altern...
AbstractA primitive permutation group is said to be extremely primitive if it is not regular and a p...
The second author was supported by the Fundação para a Ciência e Tecnologia (Portuguese Foundation f...
AbstractPin showed that every p-state automaton (p a prime) containing a cyclic permutation and a no...
A transitive permutation group G on a finite set Omega is said to be pre-primitive if every G-invari...
The Hall–Paige conjecture asserts that a finite group has a complete mapping if and only if its Sylo...
The Hall-Paige conjecture asserts that a finite group has a complete mapping if and only if its Sylo...
2022 Spring.Includes bibliographical references.The class of permutation groups includes 2-homogeneo...
About 15 years ago, Araújo, Arnold and Steinberg introduced the notion of synchronisation to the the...
An automaton (consisting of a finite set of states with given transitions) is said to be synchronizi...
Let Ω be a set of cardinality n, G a permutation group on Ω, and f : Ω → Ω a map which is not a perm...
iAbstract The synchronization property emerged from finite state automata and transformation semigro...
An automaton is said to be synchronizing if there is a word in the transitions which sends all state...
Suppose that a deterministic finite automata A = (Q ,Σ) is such that all but one letters from the a...
© 2016 London Mathematical Society. Let Ω be a set of cardinality n, G be a permutation group on Ω a...
The primitive finite permutation groups containing a cycle are classified. Of these, only the altern...
AbstractA primitive permutation group is said to be extremely primitive if it is not regular and a p...
The second author was supported by the Fundação para a Ciência e Tecnologia (Portuguese Foundation f...
AbstractPin showed that every p-state automaton (p a prime) containing a cyclic permutation and a no...
A transitive permutation group G on a finite set Omega is said to be pre-primitive if every G-invari...