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 sporadic simple group J4). We apply this result to prove that primitive permutation groups of simple diagonal type with three or more simple factors in the socle are non-synchronizing. We also give the simpler proof that, for groups of affine type, or simple diagonal type with two socle factors, synchronization and separation are equivalent. Synchronization and separation are conditions on permutation groups which are stronger than primitivity but weaker than 2-homogeneity, the second of these being stronger ...
Recently Peter Keevash solved asymptotically the existence question for Steiner systems by showing t...
The second author was supported by the Fundação para a Ciência e Tecnologia (Portuguese Foundation f...
AbstractIn 1955 Hall and Paige conjectured that a finite group is admissible, i.e., admits complete ...
The Hall–Paige conjecture asserts that a finite group has a complete mapping if and only if its Sylo...
© 2016 London Mathematical Society. Let Ω be a set of cardinality n, G be a permutation group on Ω a...
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...
Every synchronising permutation group is primitive and of one of three types: affine, almost simple,...
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...
Let Ω be a set of cardinality n, G a permutation group on Ω, and f : Ω → Ω a map which is not a perm...
An automaton (consisting of a finite set of states with given transitions) is said to be synchronizi...
iAbstract The synchronization property emerged from finite state automata and transformation semigro...
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on t...
AbstractA complete mapping of a group G is a permutation ϕ:G→G such that g↦gϕ(g) is also a permutati...
Recently Peter Keevash solved asymptotically the existence question for Steiner systems by showing t...
The second author was supported by the Fundação para a Ciência e Tecnologia (Portuguese Foundation f...
AbstractIn 1955 Hall and Paige conjectured that a finite group is admissible, i.e., admits complete ...
The Hall–Paige conjecture asserts that a finite group has a complete mapping if and only if its Sylo...
© 2016 London Mathematical Society. Let Ω be a set of cardinality n, G be a permutation group on Ω a...
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...
Every synchronising permutation group is primitive and of one of three types: affine, almost simple,...
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...
Let Ω be a set of cardinality n, G a permutation group on Ω, and f : Ω → Ω a map which is not a perm...
An automaton (consisting of a finite set of states with given transitions) is said to be synchronizi...
iAbstract The synchronization property emerged from finite state automata and transformation semigro...
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on t...
AbstractA complete mapping of a group G is a permutation ϕ:G→G such that g↦gϕ(g) is also a permutati...
Recently Peter Keevash solved asymptotically the existence question for Steiner systems by showing t...
The second author was supported by the Fundação para a Ciência e Tecnologia (Portuguese Foundation f...
AbstractIn 1955 Hall and Paige conjectured that a finite group is admissible, i.e., admits complete ...