Related papers: The complexity of quantified constraints using the…

We examine some flexible notions of constraint satisfaction, observing some relationships between model theoretic notions of universal Horn class membership and robust satisfiability. We show the \texttt{NP}-completeness of $2$-robust…

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

Let $A$ be a residually finite dimensional algebra (not necessarily associative) over a field $k$. Suppose first that $k$ is algebraically closed. We show that if $A$ satisfies a homogeneous almost identity $Q$, then $A$ has an ideal of…

A ternary permutation constraint satisfaction problem (CSP) is specified by a subset Pi of the symmetric group S_3. An instance of such a problem consists of a set of variables V and a set of constraints C, where each constraint is an…

What sets A \subset Z^n can be written in the form (K-K) \cap Z^n, where K is a compact subset of R^n such that K+Z^n=R^n? Such sets A are called achievable, and it is known that if A is achievable, then < A >=Z^n. This condition completely…

We discuss Poisson structures on a weighted polynomial algebra $A:=\Bbbk[x, y, z]$ defined by a homogeneous element $\Omega\in A$, called a potential. We start with classifying potentials $\Omega$ of degree deg$(x)+$deg$(y)+$deg$(z)$ with…

Although an important issue in canonical quantization, the problem of representing the constraint algebra in the loop representation of quantum gravity has received little attention. The only explicit computation was performed by Gambini,…

Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set constraint satisfaction problems (set CSPs). Such problems…

In the recently emerging field of nonabelian group-based cryptography, a prominently used one-way function is the Conjugacy Search Problem (CSP), and two important classes of platform groups are polycyclic and matrix groups. In this paper,…

Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…

We explain that a new theorem of Deligne on symmetric tensor categories implies, in a straightforward manner, that any finite dimensional triangular Hopf algebra over an algebraically closed field of characteristic zero has Chevalley…

We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated representations of combinatorial constrained problems. This new format is able to deal with mono/multi optimization, many types of variables, cost…

Every CSP(B) for a finite structure B is either in P or it is NP-complete but the proofs of the finite-domain CSP dichotomy by Andrei Bulatov and Dimitryi Zhuk not only show the computational complexity separation but also confirm the…

We construct uncountably categorical 3-nilpotent groups of exponent p > 3. They are not one-based and do not allow the interpretation of an infinite field. Therefore they are counterexamples to Zilbers Conjecture. First 2-nilpotent new…

In the previous article a new combinatorial and thus purely algebraical approach to quantum gravity, called Algebraic Quantum Gravity (AQG), was introduced. In the framework of AQG existing semiclassical tools can be applied to operators…

Cook and Reckhow 1979 pointed out that NP is not closed under complementation iff there is no propositional proof system that admits polynomial size proofs of all tautologies. Theory of proof complexity generators aims at constructing sets…

The quantum Kepler-Coulomb system in 3 dimensions is well known to be 2nd order superintegrable, with a symmetry algebra that closes polynomially under commutators. This polynomial closure is also typical for 2nd order superintegrable…

We study constraint satisfaction problems (CSPs) where the constraint languages are defined by finite automata, giving rise to automata-based CSPs. The key notion is the concept of Automatic Constraint Satisfaction Problem ($AutCSP$), where…

Let $A$ be a finitely generated $K$-algebra that is a domain of GK dimension less than 3, and let $Q(A)$ denote the quotient division algebra of $A$. We show that if $D$ is a division subalgebra of $Q(A)$ of GK dimension at least 2 then…

We prove the well posedness in weighted Sobolev spaces of certain linear and nonlinear elliptic boundary value problems posed on convex domains and under singular forcing. It is assumed that the weights belong to the Muckenhoupt class $A_p$…