Related papers: Parameterized Complexity Results in Symmetry Break…
Within the framework of generalized combinatorial approach, the complexity is determined for infinite set of self-similar hierarchical ensembles. This complexity is shown to increase with strengthening of the hierarchy coupling to the…
The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric integer programs are studied from a group theoretical viewpoint. We investigate the structure of integer solutions of integer programs and show…
A principled approach to cyclicality and intransitivity in paired comparison data is developed. The proposed methodology enables more precise estimation of the underlying preference profile and facilitates the identification of all cyclic…
It is by now well known that symmetries may be broken at high temperature. However,in renormalizable supersymmetric theories any internal symmetry gets always restored. In nonrenormalizable theories the situation is far less simple. We…
We introduce an algorithm that exploits a combinatorial symmetry of an arrangement in order to produce a geometric reflection between two disconnected components of its moduli space. We apply this method to disqualify three real examples…
We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraints, maximum number of occurrences of a variable in the…
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
Inspired by the concept of complementarity, we present a illustrative model for the weak interactions with unbroken gauge symmetry and unbroken supersymmetry. The observable particles are bound states of some more fundamental particles.…
What is the minimal information that a robot must retain to achieve its task? To design economical robots, the literature dealing with reduction of combinatorial filters approaches this problem algorithmically. As lossless state compression…
Parameterized complexity enables the practical solution of generally intractable NP-hard problems when certain parameters are small, making it particularly useful in real-world applications. The study of string problems in this framework…
Some of the difficulties arising when one tries to understand confinement as well as dynamical and anomalous chiral symmetry breaking are reviewed. Criteria to be fulfilled by a successful and complete picture of these phenomena are…
We study the parameterized complexity of the problems of finding a maximum common (induced) subgraph of two given graphs. Since these problems generalize several NP-complete problems, they are intractable even when parameterized by strongly…
Symmetry is a fundamental concept in modern physics and other related sciences. Being such a powerful tool, almost all physical theories can be derived from symmetry, and the effectiveness of such an approach is astonishing. Since many…
Advancements in mathematical programming have made it possible to efficiently tackle large-scale real-world problems that were deemed intractable just a few decades ago. However, provably optimal solutions may not be accepted due to 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…
Symmetry properties of the evolution equation and the state to be controlled are shown to determine the basic features of the linear control of unstable orbits. In particular, the selection of control parameters and their minimal number are…
We introduce a new technique for solving uni-parametric versions of linear programs, convex quadratic programs, and linear complementarity problems in which a single parameter is permitted to be present in any of the input data. We…
In many decision-making processes, one may prefer multiple solutions to a single solution, which allows us to choose an appropriate solution from the set of promising solutions that are found by algorithms. Given this, finding a set of…
Complex spatiotemporal patterns in nature significantly challenge reductionism-based modern science. The lack of a paradigm beyond reductionism hinders our understanding of the emergence of complexity. The diversity of countless patterns…
In this paper we studied combinatorial problems with parameterized locally budgeted uncertainty. We are looking for a solutions set such that for any parameters vector there exists a solution in the set with robustness near optimal. The…