Related papers: The complexity of quantified constraints using the…
We describe the basic complex geometry and function theory of the {\em pentablock} $\mathcal{P}$, which is the bounded domain in $\mathbb{C}^3$ given by \[ \mathcal{P}= \{(a_{21}, \mathrm{tr} A, \det A): A= \begin{bmatrix}…
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…
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…
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…
Let gamma be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in gamma is in Logspace or complete for the class CSP(gamma)_NP under…
The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A central line of research is concerned with the identification of…
In this paper we provide an extended formulation for the class of constraint satisfaction problems and prove that its size is polynomial for instances whose constraint graph has bounded treewidth. This implies new upper bounds on extension…
We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An important aspect is detecting when enumeration was complete and…
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 study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…
We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…
Amalgamation SNP (ASNP) is a fragment of existential second-order logic that strictly contains binary connected MMSNP of Feder and Vardi and binary guarded monotone SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate…
This paper generalizes former works of Derksen, Weyman and Zelevinsky about quivers with potentials. We consider semisimple finite-dimensional algebras $E$ over a field $F$, such that $E \otimes_{F} E^{op}$ is semisimple. We assume that $E$…
Let $A$ be a finite-dimensional commutative associative algebra with unity over an algebraically closed field $\mathbb{K}$. The purpose of the paper is to study the solvability of $G_A$, where $G_A$ is the identity component of…
Superintegrable systems are a class of physical systems which possess more conserved quantities than their degrees of freedom. The study of these systems has a long history and continues to attract significant international attention. This…
The constraint satisfaction problem (CSP) has important applications in computer science and AI. In particular, infinite-domain CSPs have been intensively used in subareas of AI such as spatio-temporal reasoning. Since constraint…
The Khavinson-Shapiro conjecture states that ellipsoids are the only bounded domains in euclidean space satisfying the following property (KS): the solution of the Dirichlet problem for polynomial data is polynomial. In this paper we show…
Let $G$ be a reductive group over a field $k$ which is algebraically closed of characteristic $p \neq 0$. We prove a structure theorem for a class of subgroup schemes of $G$, for $p$ bounded below by the Coxeter number of $G$. As…
Random instances of Constraint Satisfaction Problems (CSP's) appear to be hard for all known algorithms, when the number of constraints per variable lies in a certain interval. Contributing to the general understanding of the structure of…
To each tagged triangulation of a surface with marked points and non-empty boundary we associate a quiver with potential, in such a way that whenever we apply a flip to a tagged triangulation, the Jacobian algebra of the QP associated to…