Related papers: Deciding subspace reachability problems with appli…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
Numerical continuation techniques are powerful tools that have been extensively used to identify particular solutions of nonlinear dynamical systems and enable trajectory design in chaotic astrodynamics problems such as the Circular…
In this short paper we show a sufficient condition for the solvability of the Dirichlet problem at infinity in Riemannian cones (as defined below).This condition is related to a celebrated result of Milnor that classifies parabolic…
Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…
We investigate connections between the geometry of linear subspaces and the convergence of the alternating projection method for linear projections. The aim of this article is twofold: in the first part, we show that even in Euclidean…
Deciding whether saddle points exist or are approximable for nonconvex-nonconcave problems is usually intractable. This paper takes a step towards understanding a broad class of nonconvex-nonconcave minimax problems that do remain…
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…
It is known that the theory of any class of normed spaces over the reals that includes all spaces of a given dimension d > 1 is undecidable, and indeed, admits a relative interpretation of second-order arithmetic. The notion of a normed…
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…
The free space diagram is a popular tool to compute the well-known Fr\'echet distance. As the Fr\'echet distance is used in many different fields, many variants have been established to cover the specific needs of these applications. Often,…
We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…
A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…
We consider a dynamical system, possibly infinite dimensional or non-autonomous, with fast and slow time scales which is oscillatory with high frequencies in the fast directions. We first derive and justify the limit system of the slow…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
It is a well known fact that the eikonal equation is well posed in complete length spaces. Among the studied notions of solutions in the literature, there is one that can be defined in any metric space using the local (descent) slope and…
The discretization of least-squares problems for linear ill-posed operator equations in Hilbert spaces is considered. The main subject of this article concerns conditions for convergence of the associated discretized minimum-norm…
The solvability in Sobolev spaces is proved for divergence form second order elliptic equations in the whole space, a half space, and a bounded Lipschitz domain. For equations in the whole space or a half space, the leading coefficients…
Given a graph $G$ and two vertices $s$ and $t$ in it, {\em graph reachability} is the problem of checking whether there exists a path from $s$ to $t$ in $G$. We show that reachability in directed layered planar graphs can be decided in…
In black hole physics, inflationary cosmology, and quantum field theories, it is conjectured that the physical laws are subject to radical changes below the Planck length. Such changes are due to effects of quantum gravity believed to…
There are competing schools of thought about the question of whether spacetime is fundamentally either continuous or discrete. Here, we consider the possibility that spacetime could be simultaneously continuous and discrete, in the same…