J. Integer Seq. 18(1), Article 15.1.3, 16 p., electronic only (2015)
Summary
Summary: This paper is about counting lattice paths. Examples are the paths counted by Catalan, Motzkin or Schröder numbers. We identify lattice paths with walks on some path-like graph. The entries of the $n$th power of the adjacency matrix are the number of paths of length $n$ with prescribed start and end position. The adjacency matrices turn out to be Toeplitz matrices. Explicit expressions for eigenvalues and eigenvectors of these matrices are known. This yields expressions for the numbers of paths in the form of trigonometric sums. We give many examples of known sequences that have such expressions.
Mathematics Subject Classification
05A15, 05A05, 15A09, 15B05
Keywords/Phrases
Catalan number, Motzkin number, transfer matrix, trigonometric sum