The Generalized Road Coloring Problem and periodic digraphs
Combinatorics
2011-02-11 v1 Probability
Abstract
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman's algorithm. Algebraic properties of periodic, strongly connected digraphs are studied in the semigroup context. An algebraic condition which characterizes periodic, strongly connected digraphs is determined in the context of periodic Markov chains.
Cite
@article{arxiv.0903.0192,
title = {The Generalized Road Coloring Problem and periodic digraphs},
author = {Greg Budzban and Philip Feinsilver},
journal= {arXiv preprint arXiv:0903.0192},
year = {2011}
}
Comments
16 pages