Related papers: Heuristics of the Cocks-Pinch method

The Langlands Programme predicts that a weight 2 newform f over a number field K with integer Hecke eigenvalues generally should have an associated elliptic curve E_f over K. In our previous paper, we associated, building on works of Darmon…

We find a new class of algebraic geometric solutions of Heun's equation with the accessory parameter belonging to a hyperelliptic curve. Dependence of these solutions from the accessory parameter as well as their relation to Heun's…

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

We use the Clemens-Griffiths method to construct smooth projective threefolds, over any field $k$ admitting a separable quadratic extension, that are $k$-unirational and $\bar{k}$-rational but not $k$-rational. When $k=\mathbb{R}$, we can…

Visual insights into a wide variety of statistical methods, for both didactic and data analytic purposes, can often be achieved through geometric diagrams and geometrically based statistical graphs. This paper extols and illustrates the…

We apply a heuristic method based on counting points over finite fields to the Poincar\'e center problem. We show that this method gives the correct results for homogeneous non linearities of degree 2 and 3. Also we obtain new evidence for…

By introducing a new point of view in Algebraic Topology relating elliptic curves in $\mathbb{R}^2$ and suitable bordism groups, the congruent number problem is solved showing that the Tunnell's theorem is also sufficient. This could be…

In this chapter, we identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making. Based on this identification, we derive algorithms that exploit these geometric…

First, we shall formulate and prove Theorem of Lie-Kolchin type for a cone and derive some algebro-geometric consequences. Next, inspired by a recent result of Dinh and Sibony we pose a conjecture of Tits type for a group of automorphisms…

This is a survey describing recents developments in enumerative geometry of curves on projective varieties. Various methods to arrive at results such as Kontsevich's formula for plane rational curves, or Caporaso-Harris's formula for plane…

We develop the (co)homological tools that make effective the construction of the quaternionic Darmon points introduced by Matthew Greenberg. In addition, we use the overconvergent cohomology techniques of Pollack--Pollack to allow for the…

Let K be a field of characteristic different from 2 and C an elliptic curve over K given by a Weierstrass equation. To divide an element of the group C by 2, one must solve a certain quartic equation. We characterise the quartics arising…

Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs…

We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…

This note presents a formula for the enumerative invariants of arbitrary genus in toric surfaces. The formula computes the number of curves of a given genus through a collection of generic points in the surface. The answer is given in terms…

We consider some variations on the classical method of Runge for effectively determining integral points on certain curves. We first prove a version of Runge's theorem valid for higher-dimensional varieties, generalizing a uniform version…

Hodographs for the Kepler problem are circles. This fact, known since almost two centuries ago, still provides the simplest path to derive the Kepler first law. Through Feynman `lost lecture', this derivation has now reached to a wider…

We give explicit formulae for the logarithmic class group pairing on an elliptic curve defined over a number field. Then we relate it to the descent relative to a suitable cyclic isogeny. This allows us to connect the resulting Selmer group…

Bayesian probabilistic numerical methods are a set of tools providing posterior distributions on the output of numerical methods. The use of these methods is usually motivated by the fact that they can represent our uncertainty due to…

We consider problems of estimation of structured covariance matrices, and in particular of matrices with a Toeplitz structure. We follow a geometric viewpoint that is based on some suitable notion of distance. To this end, we overview and…