Circular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials - Mathematics > CombinatoricsReport as inadecuate




Circular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: We count the number of walks of length n on a k-node circular digraph thatcover all k nodes in two ways. The first way illustrates the transfer-matrixmethod. The second involves counting various classes of height-restrictedlattice paths. We observe that the results also count so-called k-balancedstrings of length n, generalizing a 1996 Putnam problem.



Author: Evangelos Georgiadis, David Callan, Qing-Hu Hou

Source: https://arxiv.org/







Related documents