Related papers: Orbit Problem Revisited
In this note we complete the calculation of the number of $GL(\mathbb R^n)$-orbits on $\Lambda^k(\mathbb R^n)^*$, by treating the cases $(n,k)= (7,4)$ and $(8,5)$ not covered in the literature. We also calculate the number of of…
We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or \#P-hard. The dichotomy criterion…
Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a…
We perform an analytical study of the bifurcation of the halo orbits around the collinear points $L_1$, $L_2$, $L_3$ for the circular, spatial, restricted three--body problem. Following a standard procedure, we reduce to the center manifold…
In this paper, which corresponds to an updated version of the author's Habilitation lecture in Mathematics, we do an overview of several topics in elliptic problems. We review some old and new results regarding the Lane-Emden equation, both…
We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…
We present a semi-analytical correction to the seminal solution for the secular motion of a planet's orbit under gravitational influence of an external perturber derived by Heppenheimer (1978). A comparison between analytical predictions…
The polynomial hierarchy has been widely studied in classical complexity theory. In this paper, we will generalize some commonly known results about the polynomial hierarchy to a version of the hierarchy extended to promise problems. This…
To explore the limitation of a class of quantum algorithms originally proposed for the Hilbert's tenth problem, we consider two further classes of mathematically non-decidable problems, those of a modified version of the Hilbert's tenth…
This paper is devoted to the classification of GL^+(2,R)-orbit closures of surfaces in the intersection of the Prym eigenform locus with various strata of quadratic differentials. We show that the following dichotomy holds: an orbit is…
We investigate the orbital stability of a putative Jovian planet in a compact binary \nu Octantis reported by Ramm et al. We re-analyzed published radial velocity data in terms of self-consistent Newtonian model and we found stable best-fit…
We set up a methodology for computer assisted proofs of the existence and the KAM stability of an arbitrary periodic orbit for Hamiltonian systems. We give two examples of application for systems with 2 and 3 degrees of freedom. The first…
We consider two algorithmic problems concerning sub-semigroups of Heisenberg groups and, more generally, two-step nilpotent groups. The first problem is Intersection Emptiness, which asks whether a finite number of given finitely generated…
Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…
Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic finite automata with practical algorithms. The historical…
The orthogonal beltway problem is the problem of recovering the $\mathrm{O}(n)$-orbit of a $\delta$-function supported at a finite number of points in $\r^n$ from its auto-correlation or, equivalently, second moment. It was introduced as a…
We give criteria for the existence of bifurcations of symmetric periodic orbits in reversible Hamiltonian systems in terms of local equivariant Lagrangian Rabinowitz Floer homology. As an example, we consider the family of the direct…
This paper proposes a solution for multiple-impulse orbital maneuvers near circular orbits for special cases where orbital observations are not globally available and the spacecraft is being observed through a limited window from a ground…
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a…
We consider the planar three body problem of planetary type and we study the generation and continuation of periodic orbits and mainly of asymmetric periodic orbits. Asymmetric orbits exist in the restricted circular three body problem only…