Related papers: Deciding subspace reachability problems with appli…
We prove results on solvability of nonlinear elliptic partial differential systems of principle type of second order. They are consequences of existence of non-radial solutions for nonlinear partial differential systems of Poisson type. As…
The Skolem Problem asks to determine whether a given linear recurrence sequence (LRS) $\langle u_n \rangle_{n=0}^\infty$ over the integers has a zero term, that is, whether there exists $n$ such that $u_n = 0$. Decidability of the problem…
We study a variant of the Riemann-Hilbert problem on the complements of hyperplane arrangements. This problem asks whether a given local system on the complement can be realized as the solution sheaf of a logarithmic Pfaffian system with…
We study the double obstacle problem for p-harmonic functions on arbitrary bounded nonopen sets E in quite general metric spaces. The Dirichlet and single obstacle problems are included as special cases. We obtain Adams' criterion for the…
In this paper we consider the problem of finding an evolution of a dynamical system that originates and terminates in given sets of states. However, if such an evolution exists then it is usually not unique. We investigate this problem and…
We consider quantum algorithms for the unique sink orientation problem on cubes. This problem is widely considered to be of intermediate computational complexity. This is because there no known polynomial algorithm (classical or quantum)…
We believe that the difference between time scale systems and ordinary differential equations is not as big as people use to think. We consider linear operators that correspond to linear dynamic systems on time scales. We study solvability…
We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…
We investigate the 2-center problem for arbitrary strictly convex, centrally symmetric curves instead of usual circles. In other words, we extend the 2-center problem (from the Euclidean plane) to strictly convex normed planes, since any…
A hyperbolic integro-differential equation is considered, as a model problem, where the convolution kernel is assumed to be either smooth or no worse than weakly singular. Well-posedness of the problem is studied in the context of semigroup…
This paper is focused on some properties of paramonotone operators on Banach spaces and their application to certain feasibility problems for convex sets in a Hilbert space and convex systems in the Euclidean space. In particular, it shows…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
This paper investigates why and when the edge-based districting problem becomes computationally intractable. The overall problem is represented as an exact mathematical programming formulation consisting of an objective function and several…
We consider the problem of separability: decide whether a Hermitian operator on a finite dimensional Hilbert tensor product is separable or entangled. We show that the tensor convolution defined for certain mappings on an almost arbitrary…
This chapter is an up-to-date account of results on globally hyperbolic spacetimes, and serves several purposes. We begin with the exposition of results from a foundational level, where the main tools are order theory and general topology,…
We provide new conditions under which the alternating projection sequence converges in norm for the convex feasibility problem where a linear subspace with finite codimension $N\geq 2$ and a lattice cone in a Hilbert space are considered.…
A low frequency approximation of the discrete Sommerfeld diffraction problems, involving the scattering of a time harmonic lattice wave incident on square lattice by a discrete Dirichlet or a discrete Neumann half-plane, is investigated. It…
We take the first steps towards a better understanding of continuous orbit equivalence, i.e., topological orbit equivalence with continuous cocycles. First, we characterise continuous orbit equivalence in terms of isomorphisms of C*-crossed…
The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known. In this paper, we provide an underapproximation for the general model by considering only runs that are…
The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…