Related papers: The Kepler problem: polynomial algebra of non-poly…
Julia Robinson has given a first-order definition of the rational integers Z in the rational numbers Q by a formula (\forall \exists \forall \exists)(F=0) where the \forall-quantifiers run over a total of 8 variables, and where F is a…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
We generalise the Siegel-Voloch theorem about S-integral points on elliptic curves as follows: let K/F denote a global function field over a finite field F of characteristic p>3, let S denote a finite set of places of K and let E/K denote a…
The hodograph of the Kepler-Coulomb problem, that is, the path traced by its velocity vector, is shown to be a circle and then it is used to investigate other properties of the motion. We obtain the configuration space orbits of the problem…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
The first integral characteristic of the two--centres problem is proven to be an approximate integral (in the sense of N.N.Nekhorossev) to the three--body problem, at least if the masses are very different and the particles are constrained…
This is the third in a series of papers in which we study the n-Selmer group of an elliptic curve, with the aim of representing its elements as curves of degree n in P^{n-1}. The methods we describe are practical in the case n=3 for…
In this paper we study the problem of how to determine all elliptic curves defined over an arbitrary number field $K$ with good reduction outside a given finite set of primes $S$ of $K$ by solving $S$-unit equations. We give examples of…
We give a fast, exact algorithm for solving Dirichlet problems with polynomial boundary functions on quadratic surfaces in R^n such as ellipsoids, elliptic cylinders, and paraboloids. To produce this algorithm, first we show that every…
In this paper, we consider the problem of determining the \emph{exact} number of periodic orbits for polynomial planar flows. This problem is a variant of Hilbert's 16th problem. Using a natural definition of computability, we show that the…
We consider the Euler type integral associated to the configuration space of points on an elliptic curve, which is an analogue of the hypergeometric function associated to the configuration space of points on a projective line. We calculate…
Studied here is the effect of the presence of symmetry groups in a system of algebraic equations on the numerical resolution with fixed-point algorithms. It is proved that the symmetries imply two important properties of the system: the…
The Stark problem is Kepler problem with an external constant acceleration. In this paper, we study the periodic orbits for Stark problem for both planar case and spatial case. We have conducted a detailed analysis of the invariant tori and…
Any compact body in ${\mathbb R}^N$ with smooth boundary defines a two-valued function on the space of affine hyperplanes: the volumes of two parts into which these hyperplanes cut the body. This function is never algebraic if $N$ is even…
The $n$ integrals in involution for the motion on the $n$-dimensional ellipsoid under the influence of a harmonic force are explicitly found. The classical separation of variables is given by the inverse momentum map. In the quantum case…
A Kepler solver is an analytical method used to solve a two-body problem. In this paper, we propose a new correction method by slightly modifying the Kepler solver. The only change to the analytical solutions is that the obtainment of the…
Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…
An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed.…
Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…