Related papers: CSP for binary conservative relational structures
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…
For relational structures A, B of the same signature, the Promise Constraint Satisfaction Problem PCSP(A,B) asks whether a given input structure maps homomorphically to A or does not even map to B. We are promised that the input satisfies…
An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP…
Given an (infinite) relational structure $\mathbb S$, we say that a finite structure $\mathbb C$ is a minimal finite factor of $\mathbb S$ if for every finite structure $\mathbb A$ there is a homomorphism $\mathbb S\to \mathbb A$ if and…
For an associative algebra $A$ with a simple module $M$ with trivial endomorphisms and trivial annihilator we verify the countable separation property (CSP), i.e. we prove that there exists a list of nonzero elements $a_1, a_2,\ldots$ of…
Let $A$ and $B$ be unital separable simple amenable \CA s which satisfy the Universal Coefficient Theorem. Suppose {that} $A$ and $B$ are $\mathcal Z$-stable and are of rationally tracial rank no more than one. We prove the following:…
One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs with a Maltsev polymorphism; we do not even know whether…
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet…
In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the form #CSP($\mathcal{C}$,-), in which the goal is, given a relational structure $\mathbf{A}$ from a class $\mathcal{C}$ of structures and an…
Let $a$ and $b$ be elements in the closed ball of a unital C$^*$-algebra $A$ (if $A$ is not unital we consider its natural unitization). We shall say that $a$ and $b$ are domain (respectively, range) absolutely compatible ($a\triangle_d b$,…
Every CSP(B) for a finite structure B is either in P or it is NP-complete but the proofs of the finite-domain CSP dichotomy by Andrei Bulatov and Dimitryi Zhuk not only show the computational complexity separation but also confirm the…
We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…
This paper's central theme is to prove the existence of an n-algebra whose multiplication cannot be expressed employing any binary operation. Furthermore, to prove if two algebras are not isomorphic, this property does not hold for…
Using aritmethic conditions on affine semigroups we prove that for a simplicial toric variety of codimension 2 the property of being a set-theoretic complete intersection on binomials in characteristic $p$ holds either for all primes $p$,…
We prove that an $\omega$-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that…
Conservative constraint satisfaction problems (CSPs) constitute an important particular case of the general CSP, in which the allowed values of each variable can be restricted in an arbitrary way. Problems of this type are well studied for…
We show that, for each finite algebra A, either it has symmetric term operations of all arities or else some finite algebra in the variety generated by A has two automorphisms without a common fixed point. We also show this two-automorphism…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
A hom-associative structure is a set $A$ together with a binary operation $\star$ and a selfmap $\alpha$ such that an $\alpha$-twisted version of associativity is fulfilled. In this paper, we assume that $\alpha$ is surjective. We show that…
We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.