Related papers: CSP for binary conservative relational structures
A triangular limit algebra A is isometrically isomorphic to the tensor algebra of a C*-correspondence if and only if its fundamental relation R(A) is a tree admitting a $Z^+_0$-valued continuous and coherent cocycle. For triangular limit…
A conservative class of constraint satisfaction problems CSPs is a class for which membership is preserved under arbitrary domain reductions. Many well-known tractable classes of CSPs are conservative. It is well known that lexleader…
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic…
We present a functorial construction which, starting from a congruence $\alpha$ of finite index in an algebra A, yields a new algebra C with the following properties: the congruence lattice of C is isomorphic to the interval of congruences…
We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…
It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph. We present a variant of this construction and show that…
The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…
A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…
We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain…
The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…
To a given multivariable C*-dynamical system $(A, \al)$ consisting of *-automorphisms, we associate a family of operator algebras $\alg(A, \al)$, which includes as specific examples the tensor algebra and the semicrossed product. It is…
Let p be a polynomial in one variable. It is shown that the universal C*-algebra of the relation p(x)=0, \|x\| \le C is semiprojective, residually finite-dimensional and has trivial extension group.
Given a satisfiable instance of 1-in-3 SAT, it is NP-hard to find a satisfying assignment for it, but it may be possible to efficiently find a solution subject to a weaker (not necessarily Boolean) predicate than `1-in-3'. There is a…
Using a binary representation for basis elements of an algebra combined with a framework of multiplier and index functions, a connection has been established between the structure of a large class of algebras and the XOR componentwise…
Suppose A and B are unital C*-algebras and A is separable. Let Rep(A,B) denote the set of all unital *-homomorphisms from A to B with the topology of pointwise convergence. We consider the problem of when the closure of the unitary orbit of…
We define a class of algebras describing links of binary semi-isolating formulas on a set of realizations for a family of 1-types of a complete theory. These algebras include algebras of isolating formulas considered before. We prove that a…
We study the complexity of infinite-domain constraint satisfaction problems: our basic setting is that a complexity classification for the CSPs of first-order expansions of a structure $\mathfrak A$ can be transferred to a classification of…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…
This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify, simplify, and extend parts of the three approaches that have been developed to…
The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to…