Related papers: CSP for binary conservative relational structures
The general intractability of the constraint satisfaction problem has motivated the study of restrictions on this problem that permit polynomial-time solvability. One major line of work has focused on structural restrictions, which arise…
We develop the theory of the higher commutator for Taylor varieties. A new higher commutator operation called the hypercommutator is defined using a type of invariant relation called a higher dimensional congruence. The hypercommutator is…
We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…
The CSP (constraint satisfaction problems) is a class of problems deciding whether there exists a homomorphism from an instance relational structure to a target one. The CSP dichotomy is a profound result recently proved by Zhuk (2020, J.…
A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…
Suppose that M is an infinite structure with finite relational vocabulary such that every relation symbol has arity at most 2. If M is simple and homogeneous then its complete theory is supersimple with finite SU-rank which cannot exceed…
A linear operator on a Hilbert space $\mathbb{H}$, in the classical approach of von Neumann, must be symmetric to guarantee self-adjointness. However, it can be shown that the symmetry could be ommited by using a criterion for the graph of…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
We investigate the `local consistency implies global consistency' principle of strict width among structures within the scope of the Bodirsky-Pinsker dichotomy conjecture for infinite-domain Constraint Satisfaction Problems (CSPs). Our main…
Let $A$ be an algebraically simple, separable, nuclear, $\mathcal{Z}$-stable $C^*$-algebra for which the trace space $T(A)$ is a Bauer simplex and the extremal boundary $\partial_e T(A)$ has finite covering dimension. We prove that each…
On every set A there is a rigid binary relation i.e. such a relation R \subseteq A \times A that there is no homomorphism (A,R) \rightarrow (A,R) except the identity (Vop{\v{e}}nka et al. [1965]). We prove that for each infinite cardinal…
Let $1 \in A \subset B$ be an inclusion of unital C*-algebras of index-finite type and depth 2. Suppose that $A$ is infinite dimensional simple with $tsr(A) = 1$ and SP-property. Then $tsr(B) \leq 2$. As a corollary when $A$ is a simple…
Constraint Satisfaction Problem on finite sets is known to be NP-complete in general but certain restrictions on the constraint language can ensure tractability. It was proved that if a constraint language has a weak near unanimity…
In a non-uniform Constraint Satisfaction problem CSP(G), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constraints imposed on specified sets of variables using the…
To a semisimple and cosemisimple Hopf algebra over an algebraically closed field, we associate a planar algebra defined by generators and relations and show that it is a connected, irreducible, spherical, non-degenerate planar algebra with…
The totally nonnegative part of a partial flag variety G/P is known to have a decomposition into semi-algebraic cells. We show that the closure of a cell is again a union of cells and give a combinatorial description of the closure…
Following the success of the so-called algebraic approach to the study of decision constraint satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently promise CSPs, we propose an algebraic framework for valued…
We derive a compact analytic formula for a complete basis of conformally invariant tensor structures for three-point functions of conserved operators in arbitrary 4D Lorentz representations. The construction follows directly from a novel…
The results here presented are a continuation of the algebraic research line which attempts to find properties of multiple-valued systems based on a poset of two agents. The aim of this paper is to exhibit two relationships between some…
A ternary permutation constraint satisfaction problem (CSP) is specified by a subset Pi of the symmetric group S_3. An instance of such a problem consists of a set of variables V and a set of constraints C, where each constraint is an…