Related papers: Almost sure orbits closeness
Weighting methods are widely used to adjust for covariates in observational studies, sample surveys, and regression settings. In this paper, we study a class of recently proposed weighting methods which find the weights of minimum…
We study the tidal interaction between a low-mass companion (e.g., a protoplanet or a black hole) in orbit about a central mass, and the accretion disk within which it is submerged. We present results for a companion on a coplanar orbit…
Consider a stationary agent A at an unknown location and a mobile agent B that must move to the vicinity of and then circumnavigate A at a prescribed distance from A. In doing so, B can only measure its distance from A, and knows its own…
We have made an extensive search for grouping amongst the near Earth asteroids (NEAs). We used two D- functions and rigorous cluster analysis approach. We have found sev- eral new groups (associations) among the NEAs: the objects moving on…
The quantitative characterization of amplitudes and periods of perturbations in orbital elements can help to our understanding the minor bodies dynamics, especially in case motion in vicinity of resonances. The main goal of this study is to…
For a probability measure $\mu$ on $[0,1]$ without discrete component, the best possible order of approximation by a finite point set in terms of the star-discrepancy is $\frac{1}{2N}$ as has been proven relatively recently. However, if…
We introduce a new information-theoretic formulation of quantum measurement uncertainty relations, based on the notion of relative entropy between measurement probabilities. In the case of a finite-dimensional system and for any approximate…
In 1995, Hill and Velani introduced the shrinking targets theory. Given a dynamical system $([0,1],T)$, they investigated the Hausdorff dimension of sets of points whose orbits are close to some fixed point. In this paper, we study the sets…
Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…
Finding special orbits (as periodic orbits) of dynamical systems by variational methods and especially by minimization methods is an old method (just think to the geodesic flow). More recently, new results concerning the existence of…
To improve our understanding of orbital instabilities in compact planetary systems, we compare suites of $N$-body simulations against numerical integrations of simplified dynamical models. We show that, surprisingly, dynamical models that…
Safe and economic operation of networked systems is often challenging. Optimization-based schemes are frequently considered, since they achieve near-optimality while ensuring safety via the explicit consideration of constraints. In…
Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…
We obtain a lower bound of the distance function (MOID) between two noncoplanar bounded Keplerian orbits (either circular or elliptic) with a common focus. This lower bound is positive and vanishes if and only if the orbits intersect. It is…
We consider the problem of proving that each point in a given set of states ("target set") can indeed be reached by a given nondeterministic continuous-time dynamical system from some initial state. We consider this problem for abstract…
The catalog of km-sized near-Earth objects (NEOs) is nearly complete. Typical impact monitoring analyses search for possible impacts over the next 100 years and none of the km-sized objects represent an impact threat over that time…
Minimum distance constraints (minDCs) appear in many geometric optimization problems. They pose major challenges for mixed-integer nonlinear programming (MINLP) due to their reverse-convexity. We develop new algorithms for tightening…
We give necessary and sufficient conditions for a sequence to be exactly realizable as the sequence of numbers of periodic points in a dynamical system. Using these conditions, we show that no non-constant polynomial is realizable, and give…
The main goal of this paper is developing the method of discrete approximations to derive necessary optimality conditions for a class of constrained sweeping processes with nonsmooth perturbations. Optimal control problems for sweeping…
We prove existence of (at most denumerable many) absolutely continuous invariant probability measures for random one-dimensional dynamical systems with asymptotic expansion. If the rate of expansion (Lyapunov exponents) is bounded away from…