Daghestan Electronic Mathematical Reports: Issue 14 (2020)
Computational Aspects of the Partition Enumeration Problem
Pages: 1 - 21
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.
formula, calculations, error, testing, programming.
To issue content
Download full text