Related papers: Combining Symmetry Breaking and Global Constraints
We consider optimization problems with a disjunctive structure of the constraints. Prominent examples of such problems are mathematical programs with equilibrium constraints or vanishing constraints. Based on the concepts of directional…
Analog layout synthesis requires some elements in the circuit netlist to be matched and placed symmetrically. However, the set of symmetries is very circuit-specific and a versatile algorithm, applicable to a broad variety of circuits, has…
A natural and established way to restrict the constraint satisfaction problem is to fix the relations that can be used to pose constraints; such a family of relations is called a constraint language. In this article, we study arc…
Applying local search algorithms to combinatorial optimization problems is not an easy feat. Typically, human intervention is required to compile the constraints to input data for some metaheuristic algorithm. In this paper, we establish a…
We provide a generalization of the approach to geometric probability advanced by the great mathematician Gian Carlo Rota, in order to apply it to generalized probabilistic physical theories. In particular, we use this generalization to…
In this letter, we introduce a new approach to formulate the family structure of the standard model. Trying to mimic the highly contrained representation structure of the standard model while extending the symmetry, we propose a…
We provide here a proof theoretic account of constraint programming that attempts to capture the essential ingredients of this programming style. We exemplify it by presenting proof rules for linear constraints over interval domains, and…
The primary goal in this thesis is to identify better syntactic constraint or bias, that is language independent but also efficiently exploitable during sentence processing. We focus on a particular syntactic construction called…
We present a framework for constructing strong mixed-integer programming formulations for logical disjunctive constraints. Our approach is a generalization of the logarithmically-sized formulations of Vielma and Nemhauser for SOS2…
Although many convex relaxations of clustering have been proposed in the past decade, current formulations remain restricted to spherical Gaussian or discriminative models and are susceptible to imbalanced clusters. To address these…
We review recent works on supersymmetry breaking and gauge mediation. We survey our current understanding of dynamical supersymmetry breaking mechanisms and describe new model building tools using duality, meta-stability, and stringy…
In this paper we apply our results on the geometry of polygons in Cartan subspaces, symmetric spaces and buildings to four problems in algebraic group theory. Two of these problems are generalizations of the problems of finding the…
Central issues of the Dirac constraint formalism are discussed in relation to the algorithmic methods of commutative algebra based on the Groebner basis techniques. For a wide class of finite dimensional polynomial degenerate Lagrangian…
We extend to non-orientable surfaces previous work on sewing constraints in Conformal Field Theory. A new constraint, related to the real projective plane, is described and is used to illustrate the correspondence with a previous…
The Narain lattice construction of string compactifications is generalized to include spontaneously broken supersymmetry. Consistency conditions from modular invariance and Lorentz symmetry are solved in full generality. This framework…
We present three Lagrangian algebras in the modular 2-category associated to the 3+1D $\mathbb{Z}_2$ topological order and discuss their physical interpretations, connecting algebras with gapped boundary conditions, and interestingly, maps…
A geometric mechanism that may, in analogy to similar notions in physics, be considered as "symmetry breaking" in geometry is described, and several instances of this mechanism in differential geometry are discussed: it is shown how…
We extend the class of recently formulated scalar-nonmetricity theories by coupling a five-parameter nonmetricity scalar to a scalar field and considering a mixed kinetic term between the metric and the scalar field. The symmetric…
Constrained codes are used to prevent errors from occurring in various data storage and data transmission systems. They can help in increasing the storage density of magnetic storage devices, in managing the lifetime of electronic storage…
Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and…