Circular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials

Simple item page
dc.creatorGeorgiadis, Evangelos
dc.creatorCallan, David
dc.creatorHou, Qing-Hu
dc.date2008-08-27
dc.date.accessioned2026-07-07T09:58:39Z
dc.date.available2026-07-07T09:58:39Z
dc.descriptionWe 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.
dc.description12 pages, 1 figure, 2 tables. Submitted.Accepted
dc.identifierhttps://arxiv.org/abs/0808.3614
dc.identifierhttp://arxiv.org/abs/0808.3614
dc.identifierThe Electronic Journal of Combinatorics 15 (2008), #R108
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167794
dc.subjectCombinatorics
dc.subject05A05; 05A15
dc.titleCircular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials
dc.typetext

Files

Collections

arXiv