|
This article is cited in 3 scientific papers (total in 3 papers)
Dimer problem on cylinders: recurrences and generating functions
A. M. Karavaev, S. N. Perepechko Petrozavodsk State University, Faculty of Mathematics, Lenin str., 33, Petrozavodsk, 185910
Abstract:
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.
Keywords:
dimer problem, perfect matchings, generating functions.
Received: 21.03.2014
Citation:
A. M. Karavaev, S. N. Perepechko, “Dimer problem on cylinders: recurrences and generating functions”, Matem. Mod., 26:11 (2014), 18–22
Linking options:
https://www.mathnet.ru/eng/mm3533 https://www.mathnet.ru/eng/mm/v26/i11/p18
|
Statistics & downloads: |
Abstract page: | 260 | Full-text PDF : | 84 | References: | 42 | First page: | 5 |
|