Related papers: Instability of one-step replica-symmetry-broken ph…
A stability analysis is made for a non-singular pre-big-bang like cosmological model based on 1-loop corrected string effective action. Its homogeneous and isotropic solution realizes non-singular transition from de Sitter universe to…
Quantum k-SAT (the problem of determining whether a k-local Hamiltonian is frustration-free) is known to be QMA_1-complete for k >= 3, and hence likely hard for quantum computers to solve. Building on a classical result of Alon and Shapira,…
This paper studies the problem of deterministic rank-one matrix completion. It is known that the simplest semidefinite programming relaxation, involving minimization of the nuclear norm, does not in general return the solution for this…
Owing to its simplicity and efficiency, the Sherman-Morrison (SM) formula has seen widespread use across various scientific and engineering applications for solving rank-one perturbed linear systems of the form $(A+uv^T)x = b$. Although the…
We study the performance of stochastic local search algorithms for random instances of the $K$-satisfiability ($K$-SAT) problem. We introduce a new stochastic local search algorithm, ChainSAT, which moves in the energy landscape of a…
We consider the linear and non linear cubic Schr\"odinger equations with periodic boundary conditions, and their approximations by splitting methods. We prove that for a dense set of arbitrary small time steps, there exists numerical…
Explicit solutions for extended objects of a Q-ball type were found analytically in a model describing complex scalar field with piecewise parabolic potential in (3+1)- and (1+1)-dimensional space-times. Such a potential provides a variety…
We present an analysis of the quantum adiabatic algorithm for solving hard instances of 3-SAT (an NP-complete problem) in terms of Random Matrix Theory (RMT). We determine the global regularity of the spectral fluctuations of the…
It is well-know that deciding consistency for normal answer set programs (ASP) is NP-complete, thus, as hard as the satisfaction problem for classical propositional logic (SAT). The best algorithms to solve these problems take exponential…
We apply the symmetry reduction method of Roberts to numerically analyze the linear stability of a one-parameter family of symmetric periodic orbits with regularizable simultaneous binary collisions in the planar pairwise symmetric…
The closed relativistic string carrying a point-like mass in the space with nontrivial geometry is considered. For rotational states of this system (resulting in non-trivial Regge trajectories) the stability problem is solved. It was shown…
We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some natural number k, is undecidable. For the important class of…
We consider random systems of equations x_1 + ... + x_k = a; 0 <= a <= 2 which are interpreted as equations modulo 3: We show for k >= 15 that the satisfiability threshold of such systems occurs where the 2-core has density 1: We show a…
In this paper, we analyze any-order Runge-Kutta spectral volume schemes (RKSV(s,k)) for solving the one-dimensional scalar hyperbolic equation. The RKSV(s,k) was constructed by using the $s$-th explicit Runge-Kutta method in…
The random 3-satisfiability (3-SAT) problem is in the unsatisfiable (UNSAT) phase when the clause density $\alpha$ exceeds a critical value $\alpha_s \approx 4.267$. However, rigorously proving the unsatisfiability of a given large 3-SAT…
We study the stability of standing-waves solutions to a scalar non-linear Klein-Gordon equation in dimension one with a quadratic-cubic non-linearity. Orbits are obtained by applying the semigroup generated by the negative complex unit…
We establish metastability of the one-dimensional Cahn-Hilliard equation for initial data that is order-one in energy and order-one in $\dot{H}^{-1}$ away from a point on the so-called slow manifold with $N$ well-separated layers.…
Random constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark instances for algorithms and they have been harnessed in probabilistic constructions of…
The random $k$-SAT problem serves as a model that represents the 'typical' $k$-SAT instances. This model is thought to undergo a phase transition as the clause density changes, and it is believed that the random $k$-SAT problem is primarily…
An analysis of the average-case complexity of solving random 3-Satisfiability (SAT) instances with backtrack algorithms is presented. We first interpret previous rigorous works in a unifying framework based on the statistical physics…