Related papers: Robust Satisfiability of Systems of Equations

We show that the spectral gap problem is undecidable. Specifically, we construct families of translationally-invariant, nearest-neighbour Hamiltonians on a 2D square lattice of d-level quantum systems (d constant), for which determining…

Maslov's class $\overline{\text{K}}$ is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that $\overline{\text{K}}$ has the…

We establish the satisfiability threshold for random $k$-SAT for all $k\ge k_0$, with $k_0$ an absolute constant. That is, there exists a limiting density $\alpha_*(k)$ such that a random $k$-SAT formula of clause density $\alpha$ is with…

We study continuity properties of Sobolev mappings $f \in W_{\mathrm{loc}}^{1,n} (\Omega, \mathbb{R}^n)$, $n \ge 2$, that satisfy the following generalized finite distortion inequality \[\lvert Df(x)\rvert^n \leq K(x) J_f(x) + \Sigma (x)\]…

We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…

We study the problem of strongly refuting semirandom $k$-LIN$(\mathbb{F})$ instances: systems of $k$-sparse inhomogeneous linear equations over a finite field $\mathbb{F}$. For the case of $\mathbb{F} = \mathbb{F}_2$, this is the…

We study the complexity of the following "resolution width problem": Does a given 3-CNF have a resolution refutation of width k? We prove that the problem cannot be decided in time O(n^((k-3)/12)). This lower bound is unconditional and does…

We study the regularity of stable solutions to the problem $$ \left\{ \begin{array}{rcll} (-\Delta)^s u &=& f(u) & \text{in} \quad B_1\,, u &\equiv&0 & \text{in} \quad \mathbb R^n\setminus B_1\,, \end{array} \right. $$ where $s\in(0,1)$.…

We investigate existence and qualitative properties of globally defined and positive radial solutions of the Lane-Emden system, posed on a Cartan-Hadamard model manifold $ \mathbb{M}^n $. We prove that, for critical or supercritical…

The properties of stability of compact set $\mathcal{K}$ which is positively invariant for a semiflow $(\Omega\times W^{1,\infty}([-r,0],\mathbb{R}^n),\Pi,\mathbb{R}^+)$ determined by a family of nonautonomous FDEs with state-dependent…

Consider a polarized complex manifold (X,L) and a ray of positive metrics on L defined by a positive metric on a test configuration for (X,L). For most of the common functionals in K\"ahler geometry, we prove that the slope at infinity…

An n dimensional monomial dynamical system over a finite field K is a nonlinear deterministic time discrete dynamical system with the property that each of the n component functions is a monic nonzero monomial function in n variables. In…

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

We study the anisotropic, incompressible Cahn-Hilliard-Navier-Stokes system with variable density in a bounded smooth domain $\Omega \subset \mathbb{R}^d$. This work extends previous results on the isotropic case by incorporating…

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The…

Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics like game theory, optimization, and matrix theory. Despite…

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…

We study two-stage robust optimization problems with mixed discrete-continuous decisions in both stages. Despite their broad range of applications, these problems pose two fundamental challenges: (i) they constitute infinite-dimensional…

We convert, within polynomial-time and sequential processing, an NP-Complete Problem into a real-variable problem of minimizing a sum of Rational Linear Functions constrained by an Asymptotic-Linear-Program. The coefficients and constants…