Computational aspects of the partition enumeration problem

A. M. Magomedov^a, S. Lawrencenko<sup>b

a</sup> Department of Mathematics and Computer Science, Daghestan Federal Research Centre of Russian Academy of Sciences, Makhachkala
^b Russian State University of Tourism and Service, Cherkizovo, Pushkino district, Moscow region

Abstract: 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.

UDC: 519.1

Received: 08.10.2020
Revised: 15.12.2020
Accepted: 15.12.2020

DOI: 10.31029/demr.14.1