Primitive groups synchronize non-uniform maps of extreme ranks

Let Ω be a set of cardinality n, G a permutation group on Ω, and f : Ω → Ω a map which is not a permutation. We say that G synchronizes f if the semigroup hG, fi contains a constant map.The first author has conjectured that a primitive group synchronizes any map whose kernel is non-uniform. Rystsov...

Full description

Bibliographic Details
Main Author: Araújo, João (author)
Other Authors: Cameron, Peter J. (author)
Format: article
Language:eng
Published: 2015
Subjects:
Synchronizing automata
Graph homomorphisms
Primitive groups
Černý conjecture
Transformation semigroups
Online Access:http://hdl.handle.net/10400.2/3816
Country:Portugal
Oai:oai:repositorioaberto.uab.pt:10400.2/3816

Internet

http://hdl.handle.net/10400.2/3816

Similar Items