Related papers: A continuous constraint satisfaction problem for t…
In this paper we analyze the structure of the UNSAT-phase of the overconstrained 3-SAT model by studying the low temperature phase of the associated disordered spin model. We derive the $\infty$ Replica Symmetry Broken equations for a…
In the last two decades the study of random instances of constraint satisfaction problems (CSPs) has flourished across several disciplines, including computer science, mathematics and physics. The diversity of the developed methods, on the…
The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisfiable instances. A PCSP instance comes with two forms of…
We investigate the Hubbard model on the anisotropic triangular lattice by means of the cellular dynamical mean field theory. The phase diagram determined in the Hubbard interaction versus temperature plane shows novel reentrant behavior in…
In a valued constraint satisfaction problem (VCSP), the goal is to find an assignment of labels to variables that minimizes a given sum of functions. Each function in the sum depends on a subset of variables, takes values which are rational…
We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a…
A class of models with self-generated disorder and controlled frustration is studied. Between the trivial case, where frustration is not present at all, and the limit case, where frustration is present over every length scale, a region with…
To systematically stress a rotationally symmetric 3D magnetic null point by advecting the opposite footpoints of the spine axis in opposite directions. This stress eventually concentrates in the vicinity of the null point forming a local…
This paper describes an extension to the constraint satisfaction problem (CSP) called MUSE CSP (MUltiply SEgmented Constraint Satisfaction Problem). This extension is especially useful for those problems which segment into multiple sets of…
We propose a method of describing a phase transition in a cell fluid model with pair interaction potential that includes repulsive and attractive parts. An exact representation of the grand partition function of this model is obtained in…
We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers $\exists^{\geq j}$, asserting the existence of $j$ distinct witnesses for the variable in question. As a continuation of our previous (CSR 2012) paper,…
A two-phase solidification process for a one-dimensional semi-infinite material is considered. It is assumed that it is ensued from a constant bulk temperature present in the vicinity of the fixed boundary, which it is modelled through a…
To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…
A binary liquid near its consolute point exhibits critical fluctuations of the local composition; the diverging correlation length has always challenged simulations. The method of choice for the calculation of critical points in the phase…
Using a mean field approach and simulation, we study the non-linear mechanical response of the vertex model (VM) of biological tissue under compression and dilation. The VM is known to exhibit a transition between rigid and fluid-like, or…
We construct a mean field theory for the lattice model of a structural glass and solve it using the replica method and one step replica symmetry breaking ansatz; this theory becomes exact in the limit of infinite dimensions. Analyzing…
We define and study a statistical mechanics ensemble that characterizes connected solutions in constraint satisfaction problems (CSPs). Built around a well-known local entropy bias, it allows us to better identify hardness transitions in…
The constraint satisfaction problem (CSP) on a relational structure B is to decide, given a set of constraints on variables where the relations come from B, whether or not there is a assignment to the variables satisfying all of the…
Constraint Satisfaction Problems (CSPs) lie at the heart of complexity theory and find application in a plethora of prominent tasks ranging from cryptography to genetics. Classical approaches use Hopfield networks to find approximate…
We present a convergence result for the finite volume method applied to a particular phase field problem suitable for simulation of pure substance solidification. The model consists of the heat equation and the phase field equation with a…