Related papers: Parameterized Complexity Results in Symmetry Break…
For a general complex scattering potential defined on a real line, we show that the equations governing invisibility of the potential are invariant under the combined action of parity and time-reversal (PT) transformation. We determine the…
The breaking of supersymmetry due to singular potentials in supersymmetric quantum mechanics is critically analyzed. It is shown that, when properly regularized, these potentials respect supersymmetry, even when the regularization parameter…
In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and…
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;…
It is pointed out that every renormalizable supersymmetric field theory has a symmetry which is hidden in plain sight, but is usually broken by soft terms which obey supersymmetry. On the other hand, the terms which break supersymmetry…
Measurement incompatibility is one of the basic aspects of quantum theory. Here we study the structure of the set of compatible -- i.e. jointly measurable -- measurements. We are interested in whether or not there exist compatible…
Today's propositional satisfiability (SAT) solvers are extremely powerful and can be used as an efficient back-end for solving NP-complete problems. However, many fundamental problems in knowledge representation and reasoning are located at…
The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in…
We introduce a variation of the well-known Newton-Hironaka polytope for algebroid hypersurfaces. This combinatorial object is a perturbed version of the original one, parametrized by a real number. For well-chosen values of the parameter,…
Some symmetry problems are formulated and solved. New simple proofs are given for the earlier studied symmetry problems.
We study the separability of permutationally symmetric quantum states. We show that for bipartite symmetric systems most of the relevant entanglement criteria coincide. However, we provide a method to generate examples of bound entangled…
Recent progress in the gauge-mediated supersymmetry breaking is reviewed, with emphasis on the theoretical problems which gauge-mediated models so successfully solve, as well as those problems which are endemic to the models themselves and…
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…
There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.
If Nature is supersymmetric at the weak interaction scale, what can we hope to learn from experiments on supersymmetric particles? The most mysterious aspect of phenomenological supersymmetry is the mechanism of spontaneous supersymmetry…
Different aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
Quantifying the complexity of systems consisting of many interacting parts has been an important challenge in the field of complex systems in both abstract and applied contexts. One approach, the complexity profile, is a measure of the…