English
Related papers

Related papers: Robust Satisfiability of Systems of Equations

200 papers

The Random K-Satisfiability Problem, consisting in verifying the existence of an assignment of N Boolean variables that satisfy a set of M=alpha N random logical clauses containing K variables each, is studied using the replica symmetric…

Disordered Systems and Neural Networks · Physics 2009-10-28 R. Monasson , R. Zecchina

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

Computation and Language · Computer Science 2024-02-28 Arka Ghosh , Piotr Hofman , Sławomir Lasota

Here we study the NP-complete $K$-SAT problem. Although the worst-case complexity of NP-complete problems is conjectured to be exponential, there exist parametrized random ensembles of problems where solutions can typically be found in…

Disordered Systems and Neural Networks · Physics 2019-07-11 Hendrik Schawe , Roman Bleim , Alexander K. Hartmann

This work is focused on the study of the nonlinear elliptic higher order equation \begin{equation}\nonumber \left( -\Delta \right)^m u = S_k[-u] + \lambda f, \qquad x \in \mathbb{R}^N, \end{equation} where the $k-$Hessian $S_k[u]$ is the…

Analysis of PDEs · Mathematics 2018-07-25 Pedro Balodis , Carlos Escudero

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

Number Theory · Mathematics 2021-06-08 J. Maurice Rojas , Yuyu Zhu

An equation $f(x)=a$, where $f$ is a complex meromorphic function and $a\in\mathbb{C}$ is a parameter, is solvable in elementary functions if the inverse map $x=f^{-1}(a)$ can be expressed as a finite composition of arithmetic operations…

Group Theory · Mathematics 2026-02-11 Miroslav Marinov , Nikola Veselinov

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the discriminant valuation, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater than…

Number Theory · Mathematics 2019-11-12 Adrien Poteaux , Martin Weimann

Let $Z(F)$ be the number of solutions of a random $k$-satisfiability formula $F$ with $n$ variables and clause density $\alpha$. Assume that the probability that $F$ is unsatisfiable is $O(1/\log(n)^{1+\e})$ for $\e>0$. We show that…

Discrete Mathematics · Computer Science 2010-06-23 Emmanuel Abbe , Andrea Montanari

We study the solvability of the equation for the smooth function F, H=-k F g, on a geodesically complete pseudo-Riemannian manifold (M,g), H being the covariant Hessian of F. A similar equation was considered by Obata and Gallot in the…

Differential Geometry · Mathematics 2016-09-07 M. Bertola , D. Gouthier

Consider $A(x,D):C^{\infty}(\Omega,E) \rightarrow C^\infty(\Omega,F)$ an elliptic and canceling linear differential operator of order $\nu$ with smooth complex coefficients in $\Omega \subset \mathbb{R}^{N}$ from a finite dimension complex…

Analysis of PDEs · Mathematics 2020-04-20 Laurent Moonens , Tiago Picon

This paper is devoted to the study of meromorphic solutions of nonlinear differential equations, specifically the equation \[ (f^n)^{(k)}(g^n)^{(k)} = \alpha^2, \] where $k$ and $n$ are positive integers with $n>2k$, and $\alpha$ is a…

Complex Variables · Mathematics 2026-03-13 Abhijit Banerjee , Sujoy Majumder , Shantanu Panja , Junfeng Xu

This work investigates the hardness of computing sparse solutions to systems of linear equations over F_2. Consider the k-EvenSet problem: given a homogeneous system of linear equations over F_2 on n variables, decide if there exists a…

Computational Complexity · Computer Science 2015-11-30 Arnab Bhattacharyya , Ameet Gadekar , Suprovat Ghoshal , Rishi Saket

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

Probability · Mathematics 2007-05-23 Dimitris Achlioptas , Assaf Naor , Yuval Peres

Given a simplicial pair $(X,A)$, a simplicial complex $Y$, and a map $f:A \to Y$, does $f$ have an extension to $X$? We show that for a fixed $Y$, this question is algorithmically decidable for all $X$, $A$, and $f$ if $Y$ has the rational…

Algebraic Topology · Mathematics 2024-10-22 Fedor Manin

If a continuous map f: X->Q is approximable arbitrary closely by embeddings X->Q, can some embedding be taken onto f by a pseudo-isotopy? This question, called Isotopic Realization Problem, was raised by Shchepin and Akhmet'ev. We consider…

Geometric Topology · Mathematics 2007-05-23 Sergey A. Melikhov

We prove a single-value version of Reshetnyak's theorem. Namely, if a non-constant map $f \in W^{1,n}_{\text{loc}}(\Omega, \mathbb{R}^n)$ from a domain $\Omega \subset \mathbb{R}^n$ satisfies the estimate $\lvert Df(x) \rvert^n \leq K…

Complex Variables · Mathematics 2025-05-16 Ilmari Kangasniemi , Jani Onninen

We establish the existence and the pointwise bound of the fundamental solution for the stationary Stokes system with measurable coefficients in the whole space $\mathbb{R}^d$, $d \ge 3$, under the assumption that weak solutions of the…

Analysis of PDEs · Mathematics 2017-05-09 Jongkeun Choi , Minsuk Yang

In this work, first we prove that for any compact set $K\subset\mathbb{R}^{n}$ and any continuous function $\phi$ defined on $\partial K$, there exists a bounded weak solution in $C(\bar{\mathbb{R}^{n}\backslash K}) \cap…

Analysis of PDEs · Mathematics 2022-08-25 Leonardo Prange Bonorino , Lucas Pinto Dutra , Filipe Jung dos Santos

Let $K$ be a one-variable function field over a field of constants of characteristic 0. Let $R$ be a holomorphy subring of $K$, not equal to $K$. We prove the following undecidability results for $R$: If $K$ is recursive, then Hilbert's…

Logic · Mathematics 2009-01-19 Laurent Moret-Bailly , Alexandra Shlapentokh

We study the problem of deciding whether a point escapes a closed subset of $\mathbb{R}^d$ under the iteration of a continuous map $f \colon \mathbb{R}^d \to \mathbb{R}^d$ in the bit-model of real computation. We give a sound partial…

Logic in Computer Science · Computer Science 2025-06-27 Eike Neumann