Dimer problem on cylinders: recurrences and generating functions

We study properties of recurrences and generating functions that arise from the problem of counting perfect matchings on cylinder graph family. It is shown that the order of the recurrences depends heavily on parity of one of the parameters of the graph family.