Related papers: Documentation for the ratpoints program
The convex hull of a set of points, $C$, serves to expose extremal properties of $C$ and can help identify elements in $C$ of high interest. For many problems, particularly in the presence of noise, the true vertex set (and facets) may be…
Here we describe the distribution of rational points on the Hilbert scheme of two points in the projective plane. More specifically, we explicitly describe a two-parameter family of height functions $H_{s, t}$, such that the height function…
Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms have matured to a reliable technology. However, the precision of solutions is usually limited due to the underlying floating-point operations. This may cause…
For a real valued function, a point is critical if its derivatives are zero, and a critical point is a saddle point if it is not a local extrema. In this paper, we study algorithms to find saddle points of general Morse index. Our approach…
We describe an algorithm for determining a minimal Weierstrass equation for hyperelliptic curves over principal ideal domains. When the curve has a rational Weierstrass point $w_0$, we also give a similar algorithm for determining the…
Scientific data sets continue to increase in both size and complexity. In the past, dedicated graphics systems at supercomputing centers were required to visualize large data sets, but as the price of commodity graphics hardware has dropped…
In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
Given a smooth cubic hypersurface $X$ over a finite field of characteristic greater than 3 and two generic points on $X$, we use a function field analogue of the Hardy-Littlewood circle method to obtain an asymptotic formula for the number…
In 1922, Mordell conjectured that the set of rational points on a smooth curve $C$ over $\mathbb{Q}$ with genus $g \ge 2$ is finite. This has been proved by Faltings in 1983. However, Coleman determined in 1985 an upper bound of…
We propose a multi-level method to increase the accuracy of machine learning algorithms for approximating observables in scientific computing, particularly those that arise in systems modeled by differential equations. The algorithm relies…
For affine plane curves defined over the rationals of genus at least two, we show that a decision algorithm for the existence of solutions also yields a search algorithm for all solutions.
Various methods have been used to construct rational points and rational curves on rationally connected algebraic varieties. We survey recent advances in two of them, the descent and the fibration method, in a number-theoretical context…
The order in which plane-filling curves visit points in the plane can be exploited to design efficient algorithms. Typically, the curves are useful because they preserve locality: points that are close to each other along the curve tend to…
In this paper, we prove a general result computing the number of rational points of bounded height on a projective variety $V$ which is covered by lines. The main technical result used to achieve this is an upper bound on the number of…
We complete the computation of all $\mathbb{Q}$-rational points on all the $64$ maximal Atkin-Lehner quotients $X_0(N)^*$ such that the quotient is hyperelliptic. To achieve this, we use a combination of various methods, namely the…
We compute the rational points on certain members of the following family of hyperelliptic curves \[C_a \colon y^2 = x^8 + (4-4a^4) x^6 + (8a^4 + 6)x^4 + (4-4a^4)x^2 + 1\] via the method first developed by Dem'yanenko \cite{dem1966rational}…
This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…
In this book chapter we survey known approaches and algorithms to compute discrepancy measures of point sets. After providing an introduction which puts the calculation of discrepancy measures in a more general context, we focus on the…
Let X be a non-singular projective hypersurface of degree 4, which is defined over the rational numbers. Assume that X has dimension 39 or more, and that X contains a real point and p-adic points for every prime p. Then X is shown to…