Cerny's conjecture, synchronizing automata, group representation theory

Simple item page
dc.creatorSteinberg, Benjamin
dc.date2008-08-10
dc.date.accessioned2026-07-07T09:55:56Z
dc.date.available2026-07-07T09:55:56Z
dc.descriptionLet us say that a Cayley graph $Γ$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $Γ$ 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 {Č}ern{ý} Cayley graphs.
dc.identifierhttps://arxiv.org/abs/0808.1429
dc.identifierhttp://arxiv.org/abs/0808.1429
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166804
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.titleCerny's conjecture, synchronizing automata, group representation theory
dc.typetext

Files

Collections

arXiv