The Complexity of Periodic Energy Minimisation

Adamson, D ORCID: 0000-0003-3343-2435, Deligkas, A, Gusev, VV and Potapov, I
(2022) The Complexity of Periodic Energy Minimisation. , 2022-8-22 - 2022-9-26.

Access the full-text of this item by clicking on the Open Access link.


The computational complexity of pairwise energy minimisation of N points in real space is a longstanding open problem. The idea of the potential intractability of the problem was supported by a lack of progress in finding efficient algorithms, even when restricted the integer grid approximation. In this paper we provide a firm answer to the problem on Zd by showing that for a large class of pairwise energy functions the problem of periodic energy minimisation is NP-hard if the size of the period (known as a unit cell) is fixed, and is undecidable otherwise. We do so by introducing an abstraction of pairwise average energy minimisation as a mathematical problem, which covers many existing models. The most influential aspects of this work are showing for the first time: 1) undecidability of average pairwise energy minimisation in general 2) computational hardness for the most natural model with periodic boundary conditions, and 3) novel reductions for a large class of generic pairwise energy functions covering many physical abstractions at once. In particular, we develop a new tool of overlapping digital rhombuses to incorporate the properties of the physical force fields, and we connect it with classical tiling problems. Moreover, we illustrate the power of such reductions by incorporating more physical properties such as charge neutrality, and we show an inapproximability result for the extreme case of the 1D average energy minimisation problem.

Item Type: Conference or Workshop Item (Unspecified)
Depositing User: Symplectic Admin
Date Deposited: 10 Oct 2022 10:26
Last Modified: 22 Nov 2023 22:42
DOI: 10.4230/LIPIcs.MFCS.2022.8
Open Access URL: