Related papers: Orbit Problem Revisited
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational…
We investigate a method to compute a finite set of preliminary orbits for solar system bodies using the first integrals of the Kepler problem. This method is thought for the applications to the modern sets of astrometric observations, where…
We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse…
In this paper we deal with the restricted Block Relocation Problem. We present a new lower bound and a heuristic approach for the problem. The proposed lower bound can be computed in polynomial time and it is provably better than some…
We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…
In this paper we study two electrons on a line on the same side of the nucleus which interact with each other by their mean value. We prove that there exists a unique periodic orbit and examine for which charges the two orbits of the…
We consider the planar three-body problem perturbed by a celestial body modeled as a time-dependent perturbation that decays in time. We assume that the motion of the celestial body is given and is unbounded with a non-zero asymptotic…
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…
We consider chance-constrained binary knapsack problems, where the weights of items are independent random variables with the means and standard deviations known. The chance constraint can be reformulated as a second-order cone constraint…
This work addresses the Hamiltonian dynamics of the Kepler problem in a deformed phase space, by considering the equatorial orbit. The recursion operators are constructed and used to compute the integrals of motion. The same investigation…
We give a probabilistic proof of the orbit-counting lemma.
The problem of determining the existence of a spectral gap in a lattice quantum spin system was previously shown to be undecidable for one [J. Bausch et al., "Undecidability of the spectral gap in one dimension", Physical Review X 10…
We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly non-simple) closed curve on the boundary of M, decide whether this curve is contractible in M. Our algorithm runs in space polynomial in…
We study almost periodic orbits of quantum systems and prove that for periodic time-dependent Hamiltonians an orbit is almost periodic if, and only if, it is precompact. In the case of quasiperiodic time-dependence we present an example of…
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.
The existence of hyperbolic orbits is proved for a class of restricted three-body problems with a fixed energy by taking limit for a sequence of periodic solutions which are obtained by variational methods.
We discuss a number of naturally arising problems in arithmetic, culled from completely unrelated sources, which turn out to have a common formulation involving "thin" orbits. These include the local-global problem for integral Apollonian…
We prove that star-like limit cycles of any planar polynomial system can also be seen either as solutions defined on a given interval of a new associated planar non-autonomous polynomial system or as heteroclinic solutions of a…
We treat the circular and elliptic restricted three-body problems in inertial frames as periodically forced Kepler problems with additional singularities and explain that in this setting the main result of [4] is applicable. This guarantees…
Analytic methods to investigate periodic orbits in galactic potentials. To evaluate the quality of the approximation of periodic orbits in the logarithmic potential constructed using perturbation theory based on Hamiltonian normal forms.…