Related papers: Instability of one-step replica-symmetry-broken ph…
We prove that for any $k\geq3$ for clause/variable ratios up to the Gibbs uniqueness threshold of the corresponding Galton-Watson tree, the number of satisfying assignments of random $k$-SAT formulas is given by the `replica symmetric…
An instance of a random constraint satisfaction problem defines a random subset S (the set of solutions) of a large product space (the set of assignments). We consider two prototypical problem ensembles (random k-satisfiability and…
We present a new exactly solvable case in strong-field QED with one-dimensional step potential (x-step). The corresponding x-step is given by an analytic asymmetric with respect to the axis x reflection function. The step can be considered…
Radiative symmetry breaking (RSB) is a theoretically appealing framework for the generation of mass scales through quantum effects. It can be successfully implemented in models with extended scalar and gauge sectors. We provide a systematic…
In the author's article "Algebraic unsolvability of problem of absolute stability of desynchronized systems" (Automat. Remote Control 51 (1990), no. 6, pp. 754--759), it was shown that in general for linear desynchronized systems there are…
Quantum satisfiability is a constraint satisfaction problem that generalizes classical boolean satisfiability. In the quantum k-SAT problem, each constraint is specified by a k-local projector and is satisfied by any state in its nullspace.…
We analyse the stability of periodic, travelling-wave solutions to the Kawahara equation and some of its generalizations. We determine the parameter regime for which these solutions can exhibit resonance. By examining perturbations of…
We study the maximum-average submatrix problem, in which given an $N \times N$ matrix $J$ one needs to find the $k \times k$ submatrix with the largest average of entries. We study the problem for random matrices $J$ whose entries are…
A major problem in evaluating stochastic local search algorithms for NP-complete problems is the need for a systematic generation of hard test instances having previously known properties of the optimal solutions. On the basis of…
We prove the large-time asymptotic orbital stability of strictly entropic Riemann shock solutions of first order scalar hyperbolic balance laws, under piecewise regular perturbations provided that the source term is dissipative about…
A field-theory approach is used to investigate the ''spin-glass effects'' on the critical behaviour of systems with weak temperature-like quenched disorder. The renormalization group (RG) analysis of the effective Hamiltonian of a model…
In this paper we provide detailed information about the instability of equilibrium solutions of a nonlinear family of localized reaction-difussion equations in dimensione one. Beyond we provide explicit formulas to the equilibrium…
The fermionic Ising spin glass models in a transverse field are investigated in a Grassmann path integral formalism. The Parisi's scheme of one-step replica symmetry breaking (RSB) is used within the static ansatz. This formalism has…
We show that the finite time blow up solutions for the co-rotational Wave Maps problem constructed in [7,15] are stable under suitably small perturbations within the co-rotational class, provided the scaling parameter $\lambda(t) =…
We present a numerical study on the stability of the 1/2, 2/1 and 1/1 retrograde mean motion resonances in the 3-body problem composed of a solar mass star, a Jupiter mass planet and an additional body with zero mass (elliptic restricted…
The XOR-satisfiability (XORSAT) problem deals with a system of $n$ Boolean variables and $m$ clauses. Each clause is a linear Boolean equation (XOR) of a subset of the variables. A $K$-clause is a clause involving $K$ distinct variables. In…
For noisy compressive sensing systems, the asymptotic distortion with respect to an arbitrary distortion function is determined when a general class of least-square based reconstruction schemes is employed. The sampling matrix is considered…
In this paper, we propose an algorithm for the positive one-in-three satisfiability problem (Pos1in3SAT). The proposed algorithm can efficiently decide the existence of a satisfying assignment in all assignments for a given formula by using…
This paper studies multistep methods for the integration of reversible dynamical systems, with particular emphasis on the planar Kepler problem. It has previously been shown by Cano & Sanz-Serna that reversible linear multisteps for…
Optimization problems such as the NP-complete 3-SAT provide an important benchmark for the difficult task of finding ground-states in strongly correlated many-body systems with rugged energy landscapes. The study of random 3-SAT problems as…