Related papers: The Polyhedron-Hitting Problem
A given Hamiltonian matrix H with real spectrum is assumed tridiagonal and non-Hermitian. Its possible Hermitizations via an amended, ad hoc inner-product metric are studied. Under certain reasonable assumptions, all of these metrics are…
We consider Calderon's inverse problem with partial data in dimensions $n \geq 3$. If the inaccessible part of the boundary satisfies a (conformal) flatness condition in one direction, we show that this problem reduces to the invertibility…
The problem of determining whether a given quantum state is separable is known to be computationally difficult. We develop an approach to this problem based on approximations of convex polytopes in high dimensions. By showing that a convex…
we consider a system with homoclinic orbit, We decompose the corresponding variational equation on the space of solutions and provide sufficient conditions for the permanency of homoclinic in the space of $C^1$ vector fields. We also…
Automating the solutions of multiple network information theory problems, stretching from fundamental concerns such as determining all information inequalities and the limitations of linear codes, to applied ones such as designing coded…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…
In this paper, we introduce and study the Parallel Polyhedral Projection Method (3PM) and the Approximate Parallel Polyhedral Projection Method (A3PM) for finding a point in the intersection of finitely many closed convex sets. Each…
This paper introduces a novel reachability problem for the scenario involving two agents, where one agent follows another agent using a feedback strategy. The geometry of the reachable set for an agent, termed \emph{dependent reachable…
The Monniaux Problem in abstract interpretation asks, roughly speaking, whether the following question is decidable: given a program $P$, a safety (\emph{e.g.}, non-reachability) specification $\varphi$, and an abstract domain of invariants…
Determining the complexity of the reachability problem for vector addition systems with states (VASS) is a long-standing open problem in computer science. Long known to be decidable, the problem to this day lacks any complexity upper bound…
Within the frame of a novel treatment we make a complete mathematical analysis of exactly solvable one-dimensional quantum systems with non-constant mass, involving their ordering ambiguities. This work extends the results recently reported…
Recurrence problems are fundamental in dynamics, and for example, sizes of the set of points recurring infinitely often to a target have been studied extensively in many contexts. For example, the problem of finding the dimension for…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
This paper considers 3-D elastic scattering problems by penetrable obstacles with embedded objects. The well-posedness of transmission problem is proved by employing integral equation method. Then the Inverse Problems , which is to recover…
We consider the following questions: when do there exist quaternionic frames with given frame spectrum and given frame vector norms? When such frames exist, is it always possible to interpolate between any two while fixing their spectra and…
Helton and Vinnikov showed that every rigidly convex curve in the real plane bounds a spectrahedron. This leads to the computational problem of explicitly producing a symmetric (positive definite) linear determinantal representation for a…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
A standard model that arises in several applications in sequential decision making is partially observable Markov decision processes (POMDPs) where a decision-making agent interacts with an uncertain environment. A basic objective in such…
Contact-rich robotic systems, such as legged robots and manipulators, are often represented as hybrid systems. However, the stability analysis and region-of-attraction computation for these systems are often challenging because of the…
The reachability problem for vector addition systems is a central problem of net theory. This problem is known to be decidable but the complexity is still unknown. Whereas the problem is EXPSPACE-hard, no elementary upper bounds complexity…