Geodesic
Dimer problem on cylinders: recurrences and generating functions
Matematičeskoe modelirovanie, Tome 26 (2014) no. 11, pp. 18-22

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{MM_2014_26_11_a1,
     author = {A. M. Karavaev and S. N. Perepechko},
     title = {Dimer problem on cylinders: recurrences and generating functions},
     journal = {Matemati\v{c}eskoe modelirovanie},
     pages = {18--22},
     publisher = {mathdoc},
     volume = {26},
     number = {11},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MM_2014_26_11_a1/}
}
TY  - JOUR
AU  - A. M. Karavaev
AU  - S. N. Perepechko
TI  - Dimer problem on cylinders: recurrences and generating functions
JO  - Matematičeskoe modelirovanie
PY  - 2014
SP  - 18
EP  - 22
VL  - 26
IS  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MM_2014_26_11_a1/
LA  - ru
ID  - MM_2014_26_11_a1
ER  - 
%0 Journal Article
%A A. M. Karavaev
%A S. N. Perepechko
%T Dimer problem on cylinders: recurrences and generating functions
%J Matematičeskoe modelirovanie
%D 2014
%P 18-22
%V 26
%N 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MM_2014_26_11_a1/
%G ru
%F MM_2014_26_11_a1
A. M. Karavaev; S. N. Perepechko. Dimer problem on cylinders: recurrences and generating functions. Matematičeskoe modelirovanie, Tome 26 (2014) no. 11, pp. 18-22. http://geodesic.mathdoc.fr/item/MM_2014_26_11_a1/