Related papers: Combining Symmetry Breaking and Global Constraints
We study conformally invariant boundary conditions that break part of the bulk symmetries. A general theory is developped for those boundary conditions for which the preserved subalgebra is the fixed algebra under an abelian orbifold group.…
When supersymmetry is spontaneously broken it will be generically non-linearly realized. A method to describe the non-linear realization of supersymmetry is with constrained superfields. We discuss the basic features of this description and…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
We consider the most general class possible of soft supersymmetry breaking terms that can be added to the MSSM, with and without R-parity violation, consistent with the sole requirement that no quadratic divergences are induced. We…
We describe the use of array expressions as constraints, which represents a consequent generalisation of the "element" constraint. Constraint propagation for array constraints is studied theoretically, and for a set of domain reduction…
We extend our models for conformal sequestering of dynamical supersymmetry breaking with decoupling vector-like matter in several different ways. These extensions enable us to simplify concrete model building, in particular, rendering large…
Symmetry breaking is a crucial technique in modern combinatorial solving, but it is difficult to be sure it is implemented correctly. The most successful approach to deal with bugs is to make solvers certifying, so that they output not just…
The purpose of this paper is to study in detail the constraint structure of the Hamiltonian and symplectic-Lagrangian descriptions for the scalar and electromagnetic fields in the presence of spatial boundaries. We carefully discuss the…
Numerical analysis has no satisfactory method for the more realistic optimization models. However, with constraint programming one can compute a cover for the solution set to arbitrarily close approximation. Because the use of constraint…
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle arguments. For this reason, it is desirable to produce…
Set constraints provide a highly general way to formulate program analyses. However, solving arbitrary boolean combinations of set constraints is NEXPTIME-hard. Moreover, while theoretical algorithms to solve arbitrary set constraints…
In this article we study the symmetry breaking phenomenon of solutions of noncooperative elliptic systems. We apply the degree for G-invariant strongly indefinite functionals to obtain simultaneously a symmetry breaking and a global…
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking predicates (SBPs) is a well-known, often effective, technique…
Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up chart parsers for PCFGs. We generalize chart constraints to more expressive grammar formalisms and describe a neural…
Constraints that may be obtained by composition from simpler constraints are present, in some way or another, in almost every constraint program. The decomposition of such constraints is a standard technique for obtaining an adequate…
The concept of (global) gauge symmetry breaking plays an important role in many areas of physics. Since the corresponding symmetry is a gauge symmetry, its breaking is actually gauge-dependent. Thus, it is possible to design gauges which…
We have previously reported a Bayesian algorithm for determining the coordinates of points in three-dimensional space from uncertain constraints. This method is useful in the determination of biological molecular structure. It is limited,…
I review our recent attempts toward obtaining the MSSM from string orbifold compactification. The required constraints are the existence of three families and R parity, vectorlike exotics, one pair of Higgs doublets, and the SU(5)$'$ hidden…
Supersymmetry might be broken, in the real world, by anomalies that affect composite operators, while leaving the action supersymmetric. New constraint equations that govern the composite operators and their anomalies are examined. It is…
We give a complete classification of intertwining operators (symmetry breaking operators) between spherical principal series representations of G=O(n+1,1) and G'=O(n,1). We construct three meromorphic families of the symmetry breaking…