Related papers: Robust Satisfiability of Systems of Equations

In a recent paper, it was shown that the problem of existence of a continuous map $X \to Y$ extending a given map $A \to Y$ defined on a subspace $A \subseteq X$ is undecidable, even for $Y$ an even-dimensional sphere. In the present paper,…

A monomial self-map $f$ on a complex toric variety is said to be $k$-stable if the action induced on the $2k$-cohomology is compatible with iteration. We show that under suitable conditions on the eigenvalues of the matrix of exponents of…

We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded independent of $n$, we call $f_r(x)$…

The \emph{Dominating $H$-Pattern} problem generalizes the classical $k$-Dominating Set problem: for a fixed \emph{pattern} $H$ and a given graph $G$, the goal is to find an induced subgraph $S$ of $G$ such that (1) $S$ is isomorphic to $H$,…

Elicitable functionals and (strictly) consistent scoring functions are of interest due to their utility of determining (uniquely) optimal forecasts, and thus the ability to effectively backtest predictions. However, in practice, assuming…

In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…

In this work, we study the existence of local solutions in $\mathbb{R}^{n}$ to $k$-Hessian equation,for which the nonhomogeneous term $f$ is permitted to change the sign or be non negative; if $f$ is $C^\infty,$ so is the local solution. We…

We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…

We address nonautonomous initial boundary value problems for decoupled linear first-order one-dimensional hyperbolic systems, investigating the phenomenon of finite time stabilization. We establish sufficient and necessary conditions…

We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent…

We provide conditions for the existence of measurable solutions to the equation $\xi(T\omega)=f(\omega,\xi(\omega))$, where $T:\Omega \rightarrow\Omega$ is an automorphism of the probability space $\Omega$ and $f(\omega,\cdot)$ is a…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

We obtained some sufficient and necessary conditions of existence of faithful irreducible representations of a soluble group $G$ of finite rank over a field $k$. It was shown that the existence of such representations strongly depends on…

Recoverable robust optimization is a popular multi-stage approach, in which it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We consider recoverable robust optimization in combination with…

Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…

Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…

Building on the univariate techniques developed by Ray and Schmidt-Hieber, we study the class $\mathcal{F}^s(\mathbb{R}^n)$ of multivariate nonnegative smooth functions that are sufficiently flat near their zeroes, which guarantees that…

Solvability of the rational quantum integrable systems related to exceptional root spaces $G_2, F_4$ is re-examined and for $E_{6,7,8}$ is established in the framework of a unified approach. It is shown the Hamiltonians take algebraic form…

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

A robust-to-dynamics optimization (RDO) problem is an optimization problem specified by two pieces of input: (i) a mathematical program (an objective function $f:\mathbb{R}^n\rightarrow\mathbb{R}$ and a feasible set…