Related papers: Documentation for the ratpoints program
The extraction and matching of interest points are fundamental to many geometric computer vision tasks. Traditionally, matching is performed by assigning descriptors to interest points and identifying correspondences based on descriptor…
An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski open subset of an arbitrary smooth biquadratic hypersurface in sufficiently many variables. The proof uses…
We give a generalization of the method of "Elliptic Curve Chabauty" to higher genus curves and their Jacobians. This method can sometimes be used in conjunction with covering techniques and a modified version of the Mordell-Weil sieve to…
In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the…
Efficient detection and description of geometric regions in images is a prerequisite in visual systems for localization and mapping. Such systems still rely on traditional hand-crafted methods for efficient generation of lightweight…
In this paper we introduce an effective method to construct rational deformations between couples of Borel-fixed ideals. These deformations are governed by flat families, so that they correspond to rational curves on the Hilbert scheme.…
Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…
We present an efficient algorithm for computing certain special values of Rankin triple product $p$-adic L-functions and give an application of this to the explicit construction of rational points on elliptic curves.
We present a computational approach to general hyperelliptic Riemann surfaces in Weierstrass normal form. The surface is either given by a list of the branch points, the coefficients of the defining polynomial or a system of cuts for the…
We give the first explicit examples beyond the Chabauty-Coleman method where Kim's nonabelian Chabauty program determines the set of rational points of a curve defined over $\mathbb{Q}$ or a quadratic number field. We accomplish this by…
We present a systematic technique to find explicit solutions of birational maps, provided that these solutions are given in terms of elliptic functions. The two main ingredients are: (i) application of classical addition theorems for…
In this paper, we reinterpret quadratic Lyapunov functions as solutions to a performance estimation saddle point problem. This allows us to automatically detect the existence of such a Lyapunov function and thus numerically check that a…
For several decades the dominant techniques for integer linear programming have been branching and cutting planes. Recently, several authors have developed core point methods for solving symmetric integer linear programs (ILPs). An integer…
We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems we introduce the new concept of core points, i.e., integral points whose orbit polytopes are…
The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to…
We present experimental evidence to support the widely held belief that one half of all elliptic curves have infinitely many rational points. The method used to gather this evidence is a refinement of an algorithm due to the author which is…
We apply the saddle-point method to derive asymptotic estimates or asymptotic series for the number of partitions of a natural integer into parts chosen from a subset of the positive integers whose associated Dirichlet series satisfies…
We give a completely explicit upper bound for integral points on (standard) affine models of hyperelliptic curves, provided we know at least one rational point and a Mordell-Weil basis of the Jacobian. We also explain a powerful refinement…
We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.
Abstract. The Set Intersection Problem (SIP) is the problem of finding a point in the intersection of convex sets. This problem is typically solved by the method of alternating projections. To accelerate the convergence, the idea of using…