Related papers: satsuma: Structure-based Symmetry Breaking in SAT
We propose a general framework for solving inverse self-assembly problems, i.e. designing interactions between elementary units such that they assemble spontaneously into a predetermined structure. Our approach uses patchy particles as…
Boolean Satisfiability (SAT) solving underpins a wide range of applications in Electronic Design Automation (EDA), particularly formal verification. However, this paper observes that the mainstream clause reduction heuristic in modern SAT…
In this work, we investigate how exploiting symmetry when creating and modifying structural models may speed up global atomistic structure optimization. We propose a search strategy in which models start from high symmetry configurations…
In this paper we introduce a novel approach for an important problem of break detection. Specifically, we are interested in detection of an abrupt change in the covariance structure of a high-dimensional random process -- a problem, which…
Mechanical metamaterials utilize geometry to achieve exceptional mechanical properties, including those not typically possible for traditional materials. To achieve these properties, it is necessary to identify the proper structures and…
Crystal structure prediction has been a subject of topical interest, but remains a substantial challenge, especially for complex structures as it deals with the global minimization of the extremely rugged high-dimensional potential energy…
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…
We present a novel approach, referred to as the 'threshold shift method' (TSM), for reliability based design optimization (RBDO). The proposed approach is similar in spirit with the sequential optimization and reliability analysis (SORA)…
We extend the well-known theoretical treatment of the spontaneous symmetry breaking (SSB) in two-component systems, combining linear coupling and self-attractive nonlinearity, to a system in which the linear coupling competes with repulsive…
This paper presents a new Matlab toolbox, aimed at facilitating the use of polynomial optimization for stability analysis of nonlinear systems. In the past decade several decisive contributions made it possible to recast this type of…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
The first part of this review tries to provide a self-contained view of supersymmetry breaking from the bottom-up perspective. We thus describe N=1 supersymmetry in four dimensions, the Standard Model and the MSSM, with emphasis on the…
Symmetry plays a fundamental role in quantum many-body physics, and a central concept is spontaneous symmetry breaking, which imposes crucial constraints on the possible quantum phases and their transitions. Recent developments have…
The reduction of constraints to obtain minimal representations of sets is a very common problem in many engineering applications. While well-established methodologies exist for the case of linear constraints, the problem of how to detect…
In this paper we explore a symmetry-based search space reduction technique which can speed up optimal pathfinding on undirected uniform-cost grid maps by up to 38 times. Our technique decomposes grid maps into a set of empty rectangles,…
Cutting rectangular items from stock sheets to satisfy demands while minimizing waste is a central manufacturing task. The Two-Dimensional Single Stock Size Cutting Stock Problem (2D-CSSP) generalizes bin packing by requiring multiple…
The fibre bundle formalism inherent to the construction of non-abelian Kaluza-Klein theories is presented and its associated dimensional reduction process analysed: is performed the dimensional reduction of G-invariant matter and gauge…
This paper studies the problem of Simultaneous Sparse Approximation (SSA). This problem arises in many applications which work with multiple signals maintaining some degree of dependency such as radar and sensor networks. In this paper, we…
Reconfiguration aims at recovering a system from a fault by automatically adapting the system configuration, such that the system goal can be reached again. Classical approaches typically use a set of pre-defined faults for which…
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function…