Related papers: Instability of one-step replica-symmetry-broken ph…

Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here an experiment is presented to demonstrate the use of Rydberg atoms…

This thesis is divided in two parts. The first presents an overview of known results in statistical mechanics of disordered systems and its approach to random combinatorial optimization problems. The second part is a discussion of two…

We undertake a systematic exploration of recurrent patterns in a 1-dimensional Kuramoto-Sivashinsky system. For a small, but already rather turbulent system, the long-time dynamics takes place on a low-dimensional invariant manifold. A set…

Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause…

Form a random k-SAT formula on n variables by selecting uniformly and independently m=rn clauses out of all 2^k (n choose k) possible k-clauses. The Satisfiability Threshold Conjecture asserts that for each k there exists a constant r_k…

Boolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic -- either as k-SAT…

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…

Approximation theory for Lyapunov and Sacker-Sell spectra based upon QR techniques is used to analyze the stability of a one-step method solving a time-dependent, linear, ordinary differential equation (ODE) initial value problem in terms…

A $k$-uniform, $d$-regular instance of Exact Cover is a family of $m$ sets $F_{n,d,k} = \{ S_j \subseteq \{1,...,n\} \}$, where each subset has size $k$ and each $1 \le i \le n$ is contained in $d$ of the $S_j$. It is satisfiable if there…

We introduce a large family of homogeneous and isotropic cosmological solutions in quadratic gravity which are singularity-free at early and late times. This kind of smooth solutions only emerges beyond the unstable de Sitter branch…

We study the rhomboidal symmetric-mass 4-body problem in both a two-degree-of-freedom and a four-degree-of-freedom setting. Under suitable changes of variables in both settings, isolated binary collisions at the origin are regularizable.…

We consider the random 2-satisfiability problem, in which each instance is a formula that is the conjunction of m clauses of the form (x or y), chosen uniformly at random from among all 2-clauses on n Boolean variables and their negations.…

In this paper we study the solution space structure of model RB, a standard prototype of Constraint Satisfaction Problem (CSPs) with growing domains. Using rigorous the first and the second moment method, we show that in the solvable phase…

In this paper we propose a new type of random CSP model, called Model RB, which is a revision to the standard Model B. It is proved that phase transitions from a region where almost all problems are satisfiable to a region where almost all…

In this paper we generalize to the case of diluted spin models and random combinatorial optimization problems a technique recently introduced by Guerra (cond-mat/0205123) to prove that the replica method generates variational bounds for…

Despite the fundamental role the Quantum Satisfiability (QSAT) problem has played in quantum complexity theory, a central question remains open: At which local dimension does the complexity of QSAT transition from "easy" to "hard"? Here, we…

We show the existence of infinitely many admissible weak solutions for the incompressible porous media equations for all Muskat-type initial data with $C^{3,\alpha}$-regularity of the interface in the unstable regime and for all…

Using methods and ideas from statistical mechanics, we propose a simple method for obtaining rigorous upper bounds for satisfiability transition in random boolean expressions composed of N variables and M clauses with K variables per…

This paper explores the analytical approach for obtaining the multiple solutions of three-wave interacting system in (1+1) dimensions. We present a novel approach by expressing the wave solutions in terms of Jacobi elliptic functions and…

We apply the analytic-numerical method of Roberts to determine the linear stability of time-reversible periodic simultaneous binary collision orbits in the symmetric collinear four body problem with masses 1, m, m, 1, and also in a…