Showing 2012Show all
2 papers · 1 filter
math.CO2012
Graphical Cyclic Permutation Groups
Mariusz Grech
We establish conditions for a permutation group generated by a single permutation of a prime power order to be an automorphism group of a graph or an edge-colored graph. This corre…
cs.FL2012
The Cerny conjecture for automata respecting intervals of a directed graph
M. Grech, A. Kisielewicz
The Černý's conjecture states that for every synchronizing automaton with n states there exists a reset word of length not exceeding (n-11)^2. We prove this conjecture for a class…