Related papers: Symmetry-breaking Answer Set Solving
Discovering governing equations, whether manually or by data-driven methods, has been central in physics and related areas. Since governing equations are typically constrained by a set of symmetries, using symmetry constraints to restrict…
In this work, we propose Answer-Set Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms have been designed, but only a few of them found their way…
Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there is constraint logic programming which computes a solution as an answer substitution to a query containing the…
In quantum many-body systems with kinetically constrained dynamics, the Hilbert space can split into exponentially many disconnected subsectors, a phenomenon known as Hilbert-space fragmentation. We study the interplay of such fragmentation…
The concepts of symmetry and its breakdown are investigated in two different terms according to whether the resulting asymmetry is universal or only obtained for a special configuration: we shall illustrate this by considering in the first…
We consider an involutive automorphism of the conformal algebra and the resulting symmetric space. We display a new action of the conformal group which gives rise to this space. The space has an intrinsic symplectic structure, a…
Answer set programming is a declarative programming paradigm oriented towards difficult combinatorial search problems. A fundamental task in answer set programming is to compute stable models, i.e., solutions of logic programs. Answer set…
The concept of symmetry breaking and the emergence of corresponding local order parameters constitute the pillars of modern day many body physics. The theory of quantum entanglement is currently leading to a paradigm shift in understanding…
The notion of hidden symmetry algebra used in the context of exactly solvable systems is re-examined from the purely algebraic way, analyzing subspaces of commuting polynomials that generate finite-dimensional quadratic algebras. By…
This paper proposes a framework that formulates a wide range of graph combinatorial optimization problems using permutation-based representations. These problems include the travelling salesman problem, maximum independent set, maximum cut,…
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…
In the last years we have proposed the use of the mechanism of spontaneous symmetry breaking with the purpose of generating perfect quadrature squeezing. Here we review previous work dealing with spatial (translational and rotational)…
We consider so-called squaring the square-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite…
Symmetry in combinatorial problems is an extensively studied topic. We continue this research in the context of model expansion problems, with the aim of automating the workflow of detecting and breaking symmetry. We focus on local domain…
In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…
We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this…
We investigate (1+1)-dimensional $\phi^4$ field theory in the symmetric and broken phases using discrete light-front quantization. We calculate the perturbative solution of the zero-mode constraint equation for both the symmetric and broken…
These lectures provide a simple introduction to supersymmetry breaking. After presenting the basics of the subject and illustrating them in tree-level examples, we discuss dynamical supersymmetry breaking, emphasizing the role of holomorphy…
We tackle the image reassembly problem with wide space between the fragments, in such a way that the patterns and colors continuity is mostly unusable. The spacing emulates the erosion of which the archaeological fragments suffer. We…
The aim of this paper is to study symmetries of linearly singular differential equations, namely, equations that can not be written in normal form because the derivatives are multiplied by a singular linear operator. The concept of…