Geodesic
Computational aspects of the partition enumeration problem
Daghestan Electronic Mathematical Reports, Tome 14 (2020), pp. 1-21

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

The problems of performing exact calculations using the classical Kasteleyn formula for calculating the number of perfect matching of a lattice graph are considered. Two tests are formulated that provide the software with automatic correction of the calculation accuracy.
Keywords: formula, calculations, error, testing, programming. 
@article{DEMR_2020_14_a0,
     author = {A. M. Magomedov and S. Lawrencenko},
     title = {Computational aspects of the partition enumeration problem},
     journal = {Daghestan Electronic Mathematical Reports},
     pages = {1--21},
     publisher = {mathdoc},
     volume = {14},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DEMR_2020_14_a0/}
}
TY  - JOUR
AU  - A. M. Magomedov
AU  - S. Lawrencenko
TI  - Computational aspects of the partition enumeration problem
JO  - Daghestan Electronic Mathematical Reports
PY  - 2020
SP  - 1
EP  - 21
VL  - 14
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DEMR_2020_14_a0/
LA  - ru
ID  - DEMR_2020_14_a0
ER  - 
%0 Journal Article
%A A. M. Magomedov
%A S. Lawrencenko
%T Computational aspects of the partition enumeration problem
%J Daghestan Electronic Mathematical Reports
%D 2020
%P 1-21
%V 14
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DEMR_2020_14_a0/
%G ru
%F DEMR_2020_14_a0
A. M. Magomedov; S. Lawrencenko. Computational aspects of the partition enumeration problem. Daghestan Electronic Mathematical Reports, Tome 14 (2020), pp. 1-21. http://geodesic.mathdoc.fr/item/DEMR_2020_14_a0/