相关论文: Revisiting the Complexity of Finding Globally Mini…
In this paper, we address the challenge of obtaining a comprehensive and symmetric representation of point particle groups, such as atoms in a molecule, which is crucial in physics and theoretical chemistry. The problem has become even more…
For the well-known model of a system of N particles with interaction (N-body problem), we consider the spatial problem of finding the minimum of the function of the kinetic energy of a system on its phase space under conditions on its size…
The Consensus Clustering problem has been introduced as an effective way to analyze the results of different microarray experiments. The problem consists of looking for a partition that best summarizes a set of input partitions (each…
The symmetry energy of nuclear matter is a fundamental ingredient in the investigation of exotic nuclei, heavy-ion collisions and astrophysical phenomena. A recently developed quantum statistical (QS) approach that takes the formation of…
We study numerically the cluster structure of random ensembles of two NP-hard optimization problems originating in computational complexity, the vertex-cover problem and the number partitioning problem. We use branch-and-bound type…
We investigate the basis-set convergence of electronic correlation energies calculated using coupled cluster theory and a recently proposed finite basis-set correction technique. The correction is applied to atomic and molecular systems and…
Characterizing the correlated behavior of nucleons inside atomic nuclei constitutes a long-standing challenge, both experimentally and theoretically. It has recently been understood that two-particle correlations in the azimuthal…
The task of identifying resolving sets has been extensively studied due to its wide relevance in fields such as chemistry, robot navigation, combinatorial optimization, pattern recognition, and image processing. These applications have…
We formalize the problem of selecting the optimal set of options for planning as that of computing the smallest set of options so that planning converges in less than a given maximum of value-iteration passes. We first show that the problem…
We propose a nearest neighbor based clustering algorithm that results in a naturally defined hierarchy of clusters. In contrast to the agglomerative and divisive hierarchical clustering algorithms, our approach is not dependent on the…
Modern nuclear structure theory is rapidly evolving towards regions of exotic short-lived nuclei far from stability, nuclear astrophysics applications, and bridging the gap between low-energy QCD and the phenomenology of finite nuclei. The…
This note advertises a simple necessary condition for optimality that any list $N\mapsto v^x(N)$ of computer-generated putative lowest average pair energies $v^x(N)$ of clusters that consist of $N$ monomers has to satisfy, whenever the…
Coupling of cluster and deformed structures are important for dynamics of nuclear structure. Threshold energy has been discussed to explain cluster structures coupling to deformed states but relation between threshold energy and excitation…
One of the outstanding problems in modern nuclear physics is to determine the properties of nuclei from the fundamental theory of the strong force, quantum chromodynamics (QCD). Skyrmions offer a novel approach to this problem by…
We present an efficient method to find minimum energy structures using energy estimates from accurate quantum Monte Carlo calculations. This method involves a stochastic process formed from the stochastic energy estimates from Monte Carlo…
The description of complex configuration is a difficult issue. We present a powerful technique for cluster identification and characterization. The scheme is designed to treat with and analyze the experimental and/or simulation data from…
Finding a cycle of lowest weight that represents a homology class in a simplicial complex is known as homology localization (HL). Here we address this NP-complete problem using parameterized complexity theory. We show that it is W[1]-hard…
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This class of optimization problems, known as rank minimization, is…
Motivated by group-project distribution, we introduce and study stable matching under the constraint of applicants needing to share a location to be matched with the same institute, which we call the Location-Restricted Stable Matching…
Light and heavy clusters are calculated for asymmetric warm nuclear matter in a relativistic mean-field approach. In-medium effects, introduced via a universal cluster-meson coupling, and a binding energy shift contribution, calculated in a…