Related papers: Flexible constraint satisfiability and a problem i…
We start the general structure theory of not necessarily semisimple finite tensor categories, generalizing the results in the semisimple case (i.e. for fusion categories), obtained recently in our joint work with D.Nikshych. In particular,…
The computational complexity of solving random 3-Satisfiability (3-SAT) problems is investigated. 3-SAT is a representative example of hard computational tasks; it consists in knowing whether a set of alpha N randomly drawn logical…
We start with a variational approach and derive a set of coupled integral equations for the bound states of $N$ identical spin-$\uparrow$ fermions and a single spin-$\downarrow$ fermion in a generic multiband Hubbard Hamiltonian with an…
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 study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…
An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP…
We present a topological barrier to efficient computation, revealed by comparing the geometry of 2 SAT and 3 SAT solution spaces. Viewing the set of satisfying assignments as a cubical complex within the Boolean hypercube, we prove that…
We show that the Membership Problem for finitely generated subgroups of 3-manifold groups is solvable.
The constraint satisfaction problem (CSP) is concerned with homomorphisms between two structures. For CSPs with restricted left-hand side structures, the results of Dalmau, Kolaitis, and Vardi [CP'02], Grohe [FOCS'03/JACM'07], and Atserias,…
A finite constraint language $\mathscr{R}$ is a finite set of relations over some finite domain $A$. We show that intractability of the constraint satisfaction problem $\operatorname{CSP}(\mathscr{R})$ can, in all known cases, be replaced…
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. Its worst-case hardness lies at the core of computational complexity theory, for example in the form of NP-hardness and the (Strong) Exponential…
We perform a global analysis of the space of consistent 6D quantum gravity theories with N = 1 supersymmetry, including models with multiple tensor multiplets. We prove that for theories with fewer than T = 9 tensor multiplets, a finite…
A delta-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying…
Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a…
We present efficient counting and sampling algorithms for random $k$-SAT when the clause density satisfies $\alpha \le \frac{2^k}{\mathrm{poly}(k)}.$ In particular, the exponential term $2^k$ matches the satisfiability threshold…
The satisfiability threshold for constraint satisfaction problems is that value of the ratio of constraints (or clauses) to variables, above which the probability that a random instance of the problem has a solution is zero in the large…
With every reduced $E$-Fountain semigroup $S$ which satisfies the generalized right ample condition we associate a category with zero morphisms $\mathcal{C}(S)$. Under some assumptions we prove an isomorphism of $\Bbbk$-algebras $\Bbbk…
We define a class of algebras, the semilattices of Mal'cev blocks (for short, SMB algebras). In a nutshell, these algebras are semilattices in which each element gets blown up into a Mal'cev algebra. We publish for the first time our old…
Feder-Vardi conjecture, which proposed that every finite-domain Constraint Satisfaction Problem (CSP) is either in P or it is NP-complete, has been solved independently by Bulatov and Zhuk almost ten years ago. Bodirsky-Pinsker conjecture…
In this paper we give an alternative construction using Monk like algebras that are binary generated to show that the class of strongly representable atom structures is not elementary. The atom structures of such algebras are cylindric…