Related papers: Revisiting the Complexity of Finding Globally Mini…
Anticipating the low energy arrangements of atoms in space is an indispensable scientific task. Modern stochastic approaches to searching for these configurations depend on the optimisation of structures to nearby local minima in the energy…
One of the great challenges of modern science is to faithfully model, and understand, matter at a wide range of scales. Starting with atoms, the vastness of the space of possible configurations poses a formidable challenge to any simulation…
In this paper, we investigate discrete logarithmic energy problems in the unit circle. We study the equilibrium configuration of $n$ electrons and $n-1$ pairs of external protons of charge $+1/2$. It is shown that all the critical points of…
One of the most challenging and frequently arising problems in many areas of science is to find solutions of a system of multivariate nonlinear equations. There are several numerical methods that can find many (or all if the system is small…
We present a new approach for the generation of stable structures of nanoclusters using deep learning methods. Our method consists in constructing an artificial potential energy surface, with local minima corresponding to the most stable…
This presentation reports on recent developments concerning basic aspects of low-energy QCD as they relate to the understanding of the nucleon mass and the nuclear many-body problem.
We consider the clustering aggregation problem in which we are given a set of clusterings and want to find an aggregated clustering which minimizes the sum of mismatches to the input clusterings. In the binary case (each clustering is a…
We give evidence that particles interacting via the simple, radially symmetric square-shoulder potential can self-organize in highly complex, low-symmetry lattices, forming thereby clusters, columns, or lamellae; only at high pressure…
Geometrical arrangements of minimum energy of a system of identical repelling particles in two dimensions are studied for different forms of the interaction potential. Stability conditions for the triangular structure are derived, and some…
Co-clustering, that is, partitioning a numerical matrix into homogeneous submatrices, has many applications ranging from bioinformatics to election analysis. Many interesting variants of co-clustering are NP-hard. We focus on the basic…
A significantly lower upper limit to minimum energy solutions of the electrostatic Thomson Problem is reported. A point charge is introduced to the origin of each $N$-charge solution. This raises the total energy by $N$ as an upper limit to…
We consider a wireless network with a set of transmitter-receiver pairs, or links, that share a common channel, and address the problem of emptying finite traffic volume from the transmitters in minimum time. This, so called, minimum-time…
The neutrino masses ordering remains one of the most important open questions in neutrino physics. While upcoming oscillation experiments aim to resolve this problem at low energies, complementary approaches are highly desirable. In this…
In this paper, we get the sharpest known to date lower bounds for the minimal Green energy of the compact harmonic manifolds of any dimension.
Clusters of solid-state quantum devices have long-living metastable states of local energy minima which may be used to store quantum information. The low to vanishing rate of dissipation fulfils the prerequisite to maintain quantum…
A novel and intuitive nearest neighbours based clustering algorithm is introduced, in which a cluster is defined in terms of an equilibrium condition which balances its size and cohesiveness. The formulation of the equilibrium condition…
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all distinct. Letting N be the number of elements in the input list,…
In the framework of computational complexity and in an effort to define a more natural reduction for problems of equivalence, we investigate the recently introduced kernel reduction, a reduction that operates on each element of a pair…
Clustering is one of the most complex phenomena known to the structure of atomic nuclei. A comprehensive description of this ubiquitous phenomenon goes beyond standard shell model and cluster model frameworks. We argue that clustering is a…
We introduce a computational method for global optimization of structure and ordering in atomic systems. The method relies on interpolation between chemical elements, which is incorporated in a machine learning structural fingerprint. The…