English
Related papers

Related papers: CSP for binary conservative relational structures

200 papers

Kadison's transitivity theorem implies that, for irreducible representations of C*-algebras, every invariant linear manifold is closed. It is known that CSL algebras have this propery if, and only if, the lattice is hyperatomic (every…

Operator Algebras · Mathematics 2007-05-23 Allan Donsig , Alan Hopenwasser , David R. Pitts

We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…

Computational Complexity · Computer Science 2018-09-26 Albert Atserias , Joanna Ochremiak

In this paper, Lie superbialgebra structures on the centerless twisted N=2 superconformal algebra $\LL$ are considered which are proved to be coboundary triangular.

Rings and Algebras · Mathematics 2008-12-31 Huanxia Fa , Junbo Li

Let A be a unital simple separable C*-algebra. If $A$ is nuclear and infinite-dimensional, it is known that strict comparison is equivalent to Z-stability if the extreme boundary of its tracial state space is non-empty, compact and of…

Operator Algebras · Mathematics 2014-06-30 Wei Zhang

We solve the lifting problem in C^*-algebras for many sets of relations that include the relations x_j^{N_j} = 0 on each variable. The remaining relations must be of the form \| p(x_1,...,x_n) \| \leq C for C a positive constant and p a…

Operator Algebras · Mathematics 2014-01-16 Terry A. Loring , Tatiana Shulman

The Constraint Satisfaction Problem (CSP) and its counting counterpart appears under different guises in many areas of mathematics, computer science, and elsewhere. Its structural and algorithmic properties have demonstrated to play a…

Combinatorics · Mathematics 2020-07-15 Raimundo Briceño , Andrei Bulatov , Victor Dalmau , Benoit Larose

We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…

Rings and Algebras · Mathematics 2009-03-25 Vesselin Drensky , Ralf Holtkamp

Let $X$ be a completely regular space. For a non-vanishing self-adjoint Banach subalgebra $H$ of $C_B(X)$ which has local units we construct the spectrum $\mathfrak{sp}(H)$ of $H$ as an open subspace of the Stone-Cech compactification of…

Functional Analysis · Mathematics 2017-06-19 M. Farhadi , M. R. Koushesh

The constraint satisfaction problem (CSP) on a finite relational structure B is to decide, given a set of constraints on variables where the relations come from B, whether or not there is a assignment to the variables satisfying all of the…

Computational Complexity · Computer Science 2024-04-24 Hubie Chen

We show that a simple separable unital nuclear nonelementary $C^*$-algebra whose tracial state space has a compact extreme boundary with finite covering dimension admits uniformly tracially large order zero maps from matrix algebras into…

Operator Algebras · Mathematics 2015-08-26 Andrew Toms , Stuart White , Wilhelm Winter

We consider all 16 unary operations that, given a homogeneous binary relation R, define a new one by a boolean combination of xRy and yRx. Operations can be composed, and connected by pointwise-defined logical junctors. We consider the…

Logic · Mathematics 2021-02-11 Jochen Burghardt

We find a class of algebras A satisfying the following property: for every nontrivial noncommutative polynomial, the linear span of all its values in A equals A. This class includes the algebras of all bounded and all compact operators on…

Operator Algebras · Mathematics 2011-04-19 Matej Bresar , Igor Klep

Let A be a unital separable C*-algebra. We observe that A is type I if and only if the CNT-entropy of every inner automorphism of A is zero.

Operator Algebras · Mathematics 2007-05-23 Nathanial P. Brown

Constraint satisfaction problems (CSPs) are an important formal framework for the uniform treatment of various prominent AI tasks, e.g., coloring or scheduling problems. Solving CSPs is, in general, known to be NP-complete and…

Computational Complexity · Computer Science 2020-07-29 Hubie Chen , Georg Gottlob , Matthias Lanzinger , Reinhard Pichler

The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…

Logic · Mathematics 2025-01-16 Andrei A. Bulatov

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…

Logic · Mathematics 2012-09-19 Tapani Hyttinen , Vadim Kulikov

An algebraic structure with two constants and one ternary operation, which is not completely commutative, is put forward to accommodate ternary Boolean algebras. When the ternary operation is interpreted as Church's conditioned disjunction,…

Rings and Algebras · Mathematics 2022-03-16 J. P. Fatelo , N. Martins-Ferreira

We propose a generalisation of the congruence subgroup problem for groups acting on rooted trees. Instead of only comparing the profinite completion to that given by level stabilizers, we also compare pro-$\mathcal{C}$ completions of the…

Group Theory · Mathematics 2024-08-27 Alejandra Garrido , Jone Uria-Albizuri

We describe symmetry structure of a general singular theory (theory with constraints in the Hamiltonian formulation), and, in particular, we relate the structure of gauge transformations with the constraint structure. We show that any…

High Energy Physics - Theory · Physics 2007-05-23 D. M. Gitman , I. V. Tyutin

We demonstrate that a pair consisting of a second-order homogeneous Hamiltonian structure in $N$ components and its associated system of conservation laws is in bijective correspondence with an alternating three-form on a $N+2$-dimensional…

Mathematical Physics · Physics 2024-10-30 Giorgio Gubbiotti , Bert van Geemen , Pierandrea Vergallo