Final Project: Transfer-Matrix Method
We introduce the transfer-matrix method, the main crux of which is a formula for the generating function for the number of walks in a digraph between two fixed vertices of varying lengths. Upon handling the main theory, we show how this method can be applied to solve various combinatorial problems that can be interpreted as counting walks in certain digraphs. (At present, only the underlying theory is treated.)