Related papers: The Continuous Skolem-Pisot Problem: On the Comple…
We study the problem of computing minimal distinguishing formulas for non-bisimilar states in finite LTSs. We show that this is NP-hard if the size of the formula must be minimal. Similarly, the existence of a short distinguishing trace is…
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter…
We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is equal to the ith term in a non-Homogenous Linear Recurrence.…
The Skolem Problem asks, given a linear recurrence sequence $(u_n)$, whether there exists $n\in\mathbb{N}$ such that $u_n=0$. In this paper we consider the following specialisation of the problem: given in addition $c\in\mathbb{N}$,…
We extend the classical Domino problem to any tiling of rhombus-shaped tiles. For any subshift X of edge-to-edge rhombus tilings, such as the Penrose subshift, we prove that the associated X-Domino problem is $\Pi^0_1$ -hard and therefore…
We prove continuity for bounded weak solutions of a nonlinear nonlocal parabolic type equation associated to a Dirichlet form with a rough kernel. The equation is allowed to be singular at the level zero, and solutions may change sign. If…
In this paper we determine the complexity of a broad class of problems that extends the temporal constraint satisfaction problems. To be more precise we study the problems Poset-SAT($\Phi$), where $\Phi$ is a given set of quantifier-free…
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…
The paper concerns the solvability by quadratures of linear differential systems, which is one of the questions of differential Galois theory. We consider systems with regular singular points as well as those with (non-resonant) irregular…
We leverage path differentiability and a recent result on nonsmooth implicit differentiation calculus to give sufficient conditions ensuring that the solution to a monotone inclusion problem will be path differentiable, with formulas for…
We obtain conditions for the differentiability of weak solutions for a second-order uniformly elliptic equation in divergence form with a homogeneous co-normal boundary condition. The modulus of continuity for the coefficients is assumed to…
In this paper we investigate formal verification problems for Neural Network computations. Various reachability problems will be in the focus, such as: Given symbolic specifications of allowed inputs and outputs in form of Linear…
Strong Feller property and irreducibility are study for a class of non-linear monotone stochastic partial differential equations with multiplicative noise. H\"older continuity of the associated Markov semigroups are discussed in some…
In this paper, we discuss the solvability of a p-k-Hessian entire inequality. We prove that the inequality with sub-lower-critical exponent admits no negative solutions. Moreover, the exponent is sharp. The proof is based on choosing…
For a class of fully nonlinear equations having second order operators which may be singular or degenerate when the gradient of the solutions vanishes, and having first order terms with power growth, we prove the existence and uniqueness of…
In this note, we prove that the problem of computing the linear discrepancy of a given matrix is $\Pi_2$-hard, even to approximate within $9/8 - \epsilon$ factor for any $\epsilon > 0$. This strengthens the NP-hardness result of Li and…
Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagram (also termed as barcode). In our earlier work, we showed that computing…
We provide a new result on the existence of extremal solutions for second-order Dirichlet problems with deviation argument. As a novelty in this work, the nonlinearity need not be continuous or monotone. In order to obtain this new result,…
We show that computing the strongest polynomial invariant for single-path loops with polynomial assignments is at least as hard as the Skolem problem, a famous problem whose decidability has been open for almost a century. While the…
We consider Dirichlet elliptic equations driven by the sum of a $p$-Laplacian $(2<p)$ and a Laplacian. The conditions on the reaction term imply that the problem is resonant at both $\pm\infty$ and at zero. We prove an existence theorem…