Circular digraph walks, \(k\)-balanced strings, lattice paths and Chebychev polynomials
zbMath1180.05002arXiv0808.3614MaRDI QIDQ1010838
David Callan, Qing-Hu Hou, Evangelos Georgiadis
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.3614
transfer matrix methodgenerating functionChebyshev polynomialCramer's rule\(k\)-balanced strings\(k\)-node circular digraphbad walkscounting walks of given lengthheight restricted lattice paths
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Paths and cycles (05C38) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Directed graphs (digraphs), tournaments (05C20)
Related Items