Related papers: CD(4) has bounded width
We investigate the properties of bounded operators which satisfy a certain spectral additivity condition, and use our results to study Lie and Jordan algebras of compact operators. We prove that these algebras have nontrivial invariant…
To a smooth, compact, oriented, properly-embedded surface in the $4$-ball, we define an invariant of its boundary-preserving isotopy class from the Khovanov homology of its boundary link. Previous work showed that when the boundary link is…
A temporal (constraint) language is a relational structure with a first-order definition in the rational numbers with the order. We study here the complexity of the Quantified Constraint Satisfaction Problem (QCSP) for temporal constraint…
Congruence modular and congruence distributive varieties can be characterized by the existence of sequences of Gumm and J\'onsson terms, respectively. Such sequences have variable lengths, in general. It is immediate from the above…
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 the approximability of Max Ones when the number of variable occurrences is bounded by a constant. For conservative constraint languages (i.e., when the unary relations are included) we give a complete classification when the number…
Given the single-letter capacity formula and the converse proof of a channel without constraints, we provide a simple approach to extend the results for the same channel but with constraints. The resulting capacity formula is the minimum of…
We develop a new theory of strong subalgebras and linear congruences that are defined globally. Using this theory we provide a new proof of the correctness of Zhuk's algorithm for all tractable CSPs on a finite domain, and therefore a new…
The cardinal direction calculus (CDC) proposed by Goyal and Egenhofer is a very expressive qualitative calculus for directional information of extended objects. Early work has shown that consistency checking of complete networks of basic…
The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…
We outline the proof that non-triangulable manifolds exist in any dimension greater than four. The arguments involve homology cobordism invariants coming from the Pin(2) symmetry of the Seiberg-Witten equations. We also explore a related…
A natural and established way to restrict the constraint satisfaction problem is to fix the relations that can be used to pose constraints; such a family of relations is called a constraint language. In this article, we study arc…
A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed…
The connection between constraint languages and clone theory has been a fruitful line of research on the complexity of constraint satisfaction problems. In a recent result, Cohen et al. [SICOMP'13] have characterised a Galois connection…
We give a relation between the existence of a Zariski decomposition and the behavior of the restricted volume of a big divisor on a smooth (complex) projective variety. Moreover, we give an analytic description of the restricted volume in…
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter…
Answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs) are arguably among the most fundamental tasks in Computer Science. They are classical NP-complete problems. Consequently, the search for tractable…
In combinatorics on words, a word w of length n over an alphabet of size q is said to be privileged if n <= 1 or if n >= 2 and w has a privileged border that occurs exactly twice in w. Forsyth, Jayakumar and Shallit proved that there exist…
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;…
We prove a conjecture of Barraud-Cornea for orientable Lagrangian surfaces. As a corollary, we obtain that displaceable Lagrangian 2--tori have finite Gromov width. In order to do so, we adapt the pearl complex of Biran-Cornea to the…