Related papers: The complexity of quantified constraints using the…
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must…
Constraint satisfaction problems (CSPs) are a natural class of decision problems where one must decide whether there is an assignment to variables that satisfies a given formula. Schaefer's dichotomy theorem, and its extension to all…
For two given idempotents $p\text{ and }q$ from an associative algebra $\mathcal{A},$ in this paper, we offer a comprehensive classification of algebras spanned by the idempotents $p\text{ and }q$. This classification is based on the…
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…
In this note, we will show that the twisted convolution algebra $L^1_{\alpha,\omega}({\sf G},\mathfrak A)$ associated to a twisted action of a locally compact group ${\sf G}$ on a $C^*$-algebra $\mathfrak A$ has the following property:…
We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…
Let G(A) be an AF-algebra given by periodic Bratteli diagram with the incidence matrix A in GL(n, Z). For a given polynomial p(x) in Z[x] we assign to G(A) a finite abelian group Z^n/p(A) Z^n. It is shown that if p(0)=1 or p(0)=-1 and…
In this paper we introduce a modified covariant quantum algebra based in the so-called Quesne-Tkachuk algebra. By means of a deformation procedure we arrive at a class of higher derivative models of gravity. The study of the particle…
We investigate properties of varieties of algebras described by a novel concept of equation that we call \emph{commutator equation}. A commutator equation is a relaxation of the standard term equality obtained substituting the equality…
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…
A commutative associative algebra A with an identity over the field of real numbers which has a basis, where all elements are invertible, is considered in the work. Moreover, among matrixes consisting of the structure constants of A, there…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
In Constraint Programming, global constraints allow to model and solve many combinatorial problems. Among these constraints, several sortedness constraints have been defined, for which propagation algorithms are available, but for which the…
We study three-dimensional Chern-Simons theory with complex gauge group SL(2,C), which has many interesting connections with three-dimensional quantum gravity and geometry of hyperbolic 3-manifolds. We show that, in the presence of a single…
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
The article gives a ring theoretic perspective on cluster algebras. Gei{\ss}-Leclerc-Schr\"oer prove that all cluster variables in a cluster algebra are irreducible elements. Furthermore, they provide two necessary conditions for a cluster…
We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by…
The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…
The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…