Circular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials

Evangelos Georgiadis, David Callan, Qing-Hu Hou

We count the number of walks of length n on a k-node circular digraph that cover all k nodes in two ways. The first way illustrates the transfer-matrix method. The second involves…