Related papers: Generating derivative superstructures for systems …
We describe an efficient practical procedure for enumerating and regrouping vacuum Feynman graphs of a given order in perturbation theory. The method is based on a combination of Schwinger-Dyson equations and the two-particle-irreducible…
We present a new method for constructing $D$-dimensional minimally superintegrable systems based on block coordinate separation of variables. We give two new families of superintegrable systems with $N$ ($N\leq D$) singular terms of the…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
Emergent design failures are ubiquitous in complex systems, and often arise when system elements cluster. Approaches to systematically reduce clustering could improve a design's resilience, but reducing clustering is difficult if it is…
We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). We show that a maze of…
We use computational modeling to investigate the assembly thermodynamics of a particle-based model for geometrically frustrated assembly, in which the local packing geometry of subunits is incompatible with uniform, strain-free large-scale…
Ordered atomic arrays with subwavelength lattice spacing emit light collectively. For fully inverted atomic arrays, this results in an initial burst of radiation and a fast build up of coherences between the atoms at initial times. Based on…
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…
The formulation of combinatorial differential forms, proposed by Forman for analysis of topological properties of discrete complexes, is extended by defining the operators required for analysis of physical processes dependent on scalar…
Isotropic pairwise interactions that promote the self assembly of complex particle morphologies have been discovered by inverse design strategies derived from the molecular coarse-graining literature. While such approaches provide an avenue…
We use inverse methods of statistical mechanics to explore trade-offs associated with designing interactions to stabilize self-assembled structures against changes in density or temperature. Specifically, we find isotropic,convex-repulsive…
Classical algorithms for predicting the equilibrium geometry of strongly correlated molecules require expensive wave function methods that become impractical already for few-atom systems. In this work, we introduce a variational quantum…
We broaden the scope of quantum field theory by introducing a general class of discrete gauge theories that realize either topological order or fracton behavior across dimensions. We start from translation-invariant systems endowed with…
We present a general framework to represent discrete configuration systems using hypergraphs. This representation allows one to transfer combinatorial removal lemmas to their analogues for configuration systems. These removal lemmas claim…
High entropy alloys offer a huge search space for new electrocatalysts. Searching for a global property maximum in one quinary system could require, depending on compositional resolution, the synthesis of up to 10E6 samples which is…
The field of complex self-assembly is moving toward the design of multi-particle structures consisting of thousands of distinct building blocks. To exploit the potential benefits of structures with such `addressable complexity,' we need to…
Ensemble models refer to methods that combine a typically large number of classifiers into a compound prediction. The output of an ensemble method is the result of fitting a base-learning algorithm to a given data set, and obtaining diverse…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
In this paper, we propose to enumerate all different configurations belonging to a specific class of fractals: A binary initial tile is selected and a finite recursive tiling process is engaged to produce auto-similar binary patterns. For…
Controlling the topology of structures self-assembled from a set of heterogeneous building blocks is highly desirable for many applications, but is poorly understood theoretically. Here we show that the thermodynamic theory of self-assembly…