Geodesic
Circular digraph walks, \(k\)-balanced strings, lattice paths and Chebychev polynomials
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 counting various classes of height-restricted lattice paths. We observe that the results also count so-called $k$-balanced strings of length $n$, generalizing a 1996 Putnam problem.
DOI : 10.37236/832
Classification : 05A05, 05A15, 33C45, 05C20, 05C38
Mots-clés : \(k\)-node circular digraph, counting walks of given length, transfer matrix method, generating function, Cramer's rule, Chebyshev polynomial, bad walks, height restricted lattice paths, \(k\)-balanced strings 
@article{10_37236_832,
     author = {Evangelos Georgiadis and David Callan and Qing-Hu Hou},
     title = {Circular digraph walks, \(k\)-balanced strings, lattice paths and {Chebychev} polynomials},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/832},
     zbl = {1180.05002},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/832/}
}
TY  - JOUR
AU  - Evangelos Georgiadis
AU  - David Callan
AU  - Qing-Hu Hou
TI  - Circular digraph walks, \(k\)-balanced strings, lattice paths and Chebychev polynomials
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/832/
DO  - 10.37236/832
ID  - 10_37236_832
ER  - 
%0 Journal Article
%A Evangelos Georgiadis
%A David Callan
%A Qing-Hu Hou
%T Circular digraph walks, \(k\)-balanced strings, lattice paths and Chebychev polynomials
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/832/
%R 10.37236/832
%F 10_37236_832
Evangelos Georgiadis; David Callan; Qing-Hu Hou. Circular digraph walks, \(k\)-balanced strings, lattice paths and Chebychev polynomials. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/832

Cité par Sources :