Related papers: CSP for binary conservative relational structures
A semigroup of binary relations (under composition) on a set $X$ is \emph{complemented} if it is closed under the taking of complements within $X\times X$. We resolve a 1991 problem of Boris Schein by showing that the class of finite unary…
Given a fixed constraint language $\Gamma$, the conservative CSP over $\Gamma$ (denoted by c-CSP($\Gamma$)) is a variant of CSP($\Gamma$) where the domain of each variable can be restricted arbitrarily. A dichotomy is known for conservative…
On every set A there is a rigid binary relation, i.e. such a relation R that there is no homomorphism (A,R)->(A,R) except the identity (Vopenka et al. [1965]). We state two conjectures which strengthen this theorem. We prove these…
Biconservative surfaces are surfaces with divergence-free stress-bienergy tensor. Simply connected, complete, non-$CMC$ biconservative surfaces in $3$-dimensional space forms were constructed working in extrinsic and intrinsic ways. Then,…
We consider the Complex Stone-Weierstrass Property (CSWP), which is the complex version of the Stone-Weierstrass Theorem. If X is a compact subspace of a product of three linearly ordered spaces, then X has the CSWP if and only if X has no…
A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…
There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…
We say that a $C^*$-algebra $\mathcal{A}$ satisfies the similarity property ((SP)) if every bounded homomorphism $u\colon \mathcal{A} \to \mathcal{B}(\mathit{H})$, where $\mathit{H}$ is a Hilbert space, is similar to a $*$-homomorphism. We…
The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…
We study two classes of operator algebras associated with a unital subsemigroup $P$ of a discrete group $G$: one related to universal structures, and one related to co-universal structures. First we provide connections between universal…
Let $\mathcal A$ be a semisimple commutative Banach algebra. It is shown that either $\mathcal A$ has exactly one uniform norm or it admits uncountably many uniform norms. Further, it is shown that there always exists a largest closed…
We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…
A constraint satisfaction problem (CSP) is a problem of computing a homomorphism ${\bf R} \rightarrow {\bf \Gamma}$ between two relational structures. Analyzing its complexity has been a very fruitful research direction, especially for…
We consider CSP from the point of view of the algebraic theory of effects, which classifies operations as effect constructors or effect deconstructors; it also provides a link with functional programming, being a refinement of Moggi's…
I discuss the relation between harmonic polynomials and invariant theory and show that homogeneous, harmonic polynomials correspond to ternary forms that are apolar to a base conic (the absolute). The calculation of Schlesinger that…
We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…
Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and artificial intelligence. Forbidding patterns (generic sub-instances) provides a means of defining…
The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main…
In this article, we study the permanence of topological and algebraic dimension type properties of simple unital $C\sp*$-algebras. When a pair of unital $C\sp*$-algebras $(A, B)$ is associated by a $*$-homomorphism $\phi: A\to B$ which is…