Cerny's conjecture, synchronizing automata, group representation theory

Details Cerny's conjecture, synchronizing automata, group representation theory Cerny's conjecture, synchronizing automata, group representation theory

2008-08-10

arxiv.org/abs/0808.1429v1

Mathematics

Combinatorics

Scientific paper

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$. In this paper we use the representation theory of groups over the rational numbers to obtain a number of new infinite families of {\v{C}}ern{\'y} Cayley graphs.

Affiliated with

Also associated with

No associations

Rating

Cerny's conjecture, synchronizing automata, group representation theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cerny's conjecture, synchronizing automata, group representation theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cerny's conjecture, synchronizing automata, group representation theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492580