Related papers: Computing Congruences Between an Elliptic Curve wi…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
Congruent polygons are congruent in angles as well as in edge lengths. We concentrate on the angle aspect, and investigate how tilings of the sphere by congruent pentagons can be determined by the angle information only. We also investigate…
The congruent number elliptic curves are defined by $E_d: y^2=x^3-d^2x$, where $d\in \mathbb{N}.$ We give a simple proof of a formula for $L(\mathrm{Sym}^2(E_d),3)$ in terms of the determinant of the elliptic trilogarithm evaluated at some…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
The traditional study of plane and space algebraic curves by looking at their tangent vectors, curvatures and torsions provides geometric, but unfortunately not sufficient information about individual curves in order to be able to…
We study the $2$-Selmer ranks of elliptic curves. We prove that for an arbitrary elliptic curve $E$ over an arbitrary number field $K$, if the set $A_E$ of 2-Selmer ranks of quadratic twists of $E$ contains an integer $c$, it contains all…
Let F be the cubic field of discriminant -23 and let O be its ring of integers. By explicitly computing cohomology of congruence subgroups of GL(2,O), we computationally investigate modularity of elliptic curves over F.
The problem of constructing elliptic curves suitable for pairing applications has received a lot of attention. To solve this, we propose a variant algorithm of a known method by Brezing and Weng. We produce new families of parameters using…
In this short note we prove a formula for local heights on elliptic curves over number fields in terms of intersection theory on a regular model over the ring of integers.
We prove a sharp H\"older estimate for solutions of linear two-dimensional, divergence form elliptic equations with measurable coefficients, such that the matrix of the coefficients is symmetric and has {\em unit determinant}. Our result…
We classify all instances of the condition $a_{p}(f) \equiv x \bmod \lambda$ being related to a congruence on the prime $p$, where $a_{p}(f)$ denotes the $p$th Fourier coefficient of a classical normalised cuspidal eigenform $f$ and…
Let $\mathcal{E}/\mathbb{F}_q$ be an elliptic curve, and $P$ a point in $\mathcal{E}(\mathbb{F}_q)$ of prime order $\ell$. V\'elu's formulae let us compute a quotient curve $\mathcal{E}' = \mathcal{E}/\langle{P}\rangle$ and rational maps…
We prove useful necessary and sufficient conditions for an elliptic curve over a number field to admit a surjective adelic Galois representation. Using these conditions, we compute an example of a number field K and an elliptic curve E/K…
Two curves are affinely equivalent if there exists an affine mapping transforming one of them onto the other. Thus, detecting affine equivalence comprises, as important particular cases, similarity, congruence and symmetry detection. In…
We present an efficient method for the computation of homogenized coefficients of divergence-form operators with random coefficients. The approach is based on a multiscale representation of the homogenized coefficients. We then implement…
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…
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…
We present a novel, log-radius profile representation for convex curves and define a new operation for combining the shape features of curves. Unlike the standard, angle profile-based methods, this operation accurately combines the shape…