Related papers: SOFI: Finding point group symmetries in atomic clu…
A routine crystallography technique, crystal structure analysis, is rarely performed in computational condensed matter research. The lack of methods to identify and characterize crystal structures reliably in particle simulation data…
Dedicated treatment of symmetries in satisfiability problems (SAT) is indispensable for solving various classes of instances arising in practice. However, the exploitation of symmetries usually takes a black box approach. Typically,…
The local arrangement of atoms is one of the most important predictors of mechanical and functional properties of materials. However, algorithms for identifying the geometrical arrangements of atoms in complex materials systems are lacking.…
The Friends-of-Friends (FoF) algorithm is a standard technique used in cosmological $N$-body simulations to identify structures. Its goal is to find clusters of particles (called groups) that are separated by at most a cut-off radius.…
Identifying symmetries in data sets is generally difficult, but knowledge about them is crucial for efficient data handling. Here we present a method how neural networks can be used to identify symmetries. We make extensive use of the…
Many standard structural quantities, such as order parameters and correlation functions, exist for common condensed matter systems, such as spherical and rod-like particles. However, these structural quantities are often insufficient for…
Object detection is a fundamental task in computer vision and has many applications in image processing. This paper proposes a new approach for object detection by applying scale invariant feature transform (SIFT) in an automatic…
Symmetry is an implicit objective in structural form-finding that often reconciles efficiency and aesthetics. This paper identifies the symmetry of polyhedral diagrams in three-dimensional graphic statics (3DGS) as point groups and…
We propose a versatile, parameter-less approach for solving the shape matching problem, specifically in the context of atomic structures when atomic assignments are not known a priori. The algorithm Iteratively suggests Rotated…
We prove for the first time that, if a linear inverse problem exhibits a group symmetry structure, gradient-based optimizers can be designed to exploit this structure for faster convergence rates. This theoretical finding demonstrates the…
We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…
Symmetry is fundamental to understanding physical systems and can improve performance and sample efficiency in machine learning. Both pursuits require knowledge of the underlying symmetries in data, yet discovering these symmetries…
A spin space group provides a suitable way to fully exploit the symmetry of a spin arrangement with a negligible spin-orbit coupling. There has been a growing interest in applying spin symmetry analysis with the spin space group in the…
We introduce the pCI software package for high-precision atomic structure calculations. The standard method of calculation is based on the configuration interaction (CI) method to describe valence correlations, but can be extended to attain…
Point clouds are versatile representations of 3D objects and have found widespread application in science and engineering. Many successful deep-learning models have been proposed that use them as input. The domain of chemical and materials…
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…
We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the symmetry transformations and the corresponding…
Order parameters based on spherical harmonics and Fourier coefficients already play a significant role in condensed matter research in the context of systems of spherical or point particles. Here, we extend these types of order parameter to…
The role of discrete (or point-group) symmetries in alpha-cluster nuclei is discussed in the framework of the algebraic cluster model which describes the relative motion of the alpha-particles. Particular attention is paid to the discrete…
A computer algorithm to search symmetries of crystal structures as implemented in the \texttt{spglib} code is described. An iterative algorithm is employed to robustly identify space group types tolerating a certain amount of distortion in…