Related papers: Computing Canonical Heights on Elliptic Curves in …

We prove a collection of results involving Colmez's periods and the Colmez Conjecture. Using Colmez's theory of periods of CM abelian varieties, we propose a definition for the height of a partial CM-type and prove that the Colmez…

The method of differential equations has been proven to be a powerful tool for the computation of multi-loop Feynman integrals appearing in quantum field theory. It has been observed that in many instances a canonical basis can be chosen,…

Geodesic metric spaces support a variety of averaging constructions for given finite sets. Computing such averages has generated extensive interest in diverse disciplines. Here we consider the inverse problem of recognizing computationally…

We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…

Elliptic curves are planar curves which can be used to define an abelian group. The efficient computation of discrete logarithms over this group is a longstanding problem relevant to cryptography. It may be possible to efficiently compute…

In this note we consider boundary point principles for partial differential inequalities of elliptic type. Firstly, we highlight the difference between conditions required to establish classical strong maximum principles and classical…

We determine the quadratic Chabauty set for integral points on elliptic curves of rank $2$ defined over imaginary quadratic fields using quadratic Chabauty. This builds on the work of Bianchi and Balakrishnan et al. We give the first…

Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b, find a vector x such that Ax=b. We consider the case where one doesn't need…

We construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time quantum walk, and thus employs a different…

Let A be an abelian variety defined over a number field K, and consider the canonical height function attached to a symmetric ample line bundle L on A. We prove that there is a positive lower bound C (depending on A, K, and L) for the…

We generalize the formula for the log canonical threshold(LCT) of plane curves over the complex numbers to arbitrary characteristics. Our proof relies purely on valuation theory, instead of on the theory of $D$-modules.

We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and…

We present new constructions of quasi-cyclic (QC) and generalized quasi-cyclic (GQC) codes from algebraic curves. Unlike previous approaches based on elliptic curves, our method applies to curves that are Kummer extensions of the rational…

Let K be a function field in one variable over an arbitrary field F. Given a rational function f(z) in K(z) of degree at least two, the associated canonical height on the projective line was defined by Call and Silverman. The preperiodic…

Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this representation…

In this article we give an explicit algorithm which will determine, in a discrete and computable way, whether a finite piecewise Euclidean complex is non-positively curved. In particular, given such a complex we show how to define a boolean…

We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…

For any quantum group of finite ADE type, we prove a new formula for the standard bilinear form evaluated at monomials. Combining this with ideas from the Lusztig-Shoji algorithm, we obtain a new algorithm that computes the canonical basis.…

Let $\C$ be a sequence of multisets of subspaces of a vector space $\F_q^k$. We describe a practical algorithm which computes a canonical form and the stabilizer of $\C$ under the group action of the general semilinear group. It allows us…

In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…