Circular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials - Mathematics > CombinatoricsReportar como inadecuado




Circular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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.



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

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados