Circular digraph walks, $k$-balanced strings, lattice paths and Chebychev polynomials.

Georgiadis, Evangelos, Callan, David, and Hou, Qing-Hu. "Circular digraph walks, -balanced strings, lattice paths and Chebychev polynomials.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R108, 11 p.-Research Paper R108, 11 p.. <http://eudml.org/doc/117264>.

@article{Georgiadis2008,
author = {Georgiadis, Evangelos, Callan, David, Hou, Qing-Hu},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {-node circular digraph; counting walks of given length; transfer matrix method; generating function; Cramer's rule; Chebyshev polynomial; bad walks; height restricted lattice paths; -balanced strings; -node circular digraph; -balanced strings},
language = {eng},
number = {1},
pages = {Research Paper R108, 11 p.-Research Paper R108, 11 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Circular digraph walks, -balanced strings, lattice paths and Chebychev polynomials.},
url = {http://eudml.org/doc/117264},
volume = {15},
year = {2008},
}

TY - JOUR
AU - Georgiadis, Evangelos
AU - Callan, David
AU - Hou, Qing-Hu
TI - Circular digraph walks, -balanced strings, lattice paths and Chebychev polynomials.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R108, 11 p.
EP - Research Paper R108, 11 p.
LA - eng
KW - -node circular digraph; counting walks of given length; transfer matrix method; generating function; Cramer's rule; Chebyshev polynomial; bad walks; height restricted lattice paths; -balanced strings; -node circular digraph; -balanced strings
UR - http://eudml.org/doc/117264
ER -