Related papers: Computing isogenies between supersingular elliptic…

A finite element method for elliptic problems with discontinuous coefficients is presented. The discontinuity is assumed to take place along a closed smooth curve. The proposed method allows to deal with meshes that are not adapted to the…

Given a lattice $L$ in the plane, we define the affiliated deep hole lattice $H(L)$ to be spanned by a shortest vector of $L$ and a deep hole of $L$ contained in the triangle with sides corresponding to the shortest basis vectors. We study…

Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…

While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…

Finding optimal matchings in dense graphs is of general interest and of particular importance in social, transportation and biological networks. While developing optimal solutions for various matching problems is important, the running…

Given a prime $p$, an elliptic curve $\E/\F_p$ over the finite field $\F_p$ of $p$ elements and a binary \lrs\ $\(u(n)\)_{n =1}^\infty$ of order~$r$, we study the distribution of the sequence of points $$ \sum_{j=0}^{r-1} u(n+j)P_j, \qquad…

For the elliptic curves $E_{\sigma 2D} : y^2 = x^3 + \sigma 2Dx$ , which has 2-isogeny curve $E'_{\sigma 2D} : y^2 = x^3 -\sigma 8Dx$, $\sigma = \pm 1,\ D = p_1^{e_1}p_2^{e_2}\cdots p_n^{e_n}$, where $p_i$ are different odd prime numbers…

A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…

Motivated by evacuation scenarios arising in extreme events such as flooding or forest fires, we study the problem of smoothly scheduling a set of paths in graphs where connections become impassable at some point in time. A schedule is…

We explain a method for computing the Cassels-Tate pairing on the 3-isogeny Selmer groups of an elliptic curve. This improves the upper bound on the rank of the elliptic curve coming from a descent by 3-isogeny, to that coming from a full…

This paper deals with elliptic equations in the plane with degeneracies. The equations are generated by a complex vector field that is elliptic everywhere except along a simple closed curve. Kernels for these equations are constructed.…

Let $\ell$ be an odd prime, and suppose $E$ is an elliptic curve defined over the rational numbers $\mathbb{Q}$. If $E$ has an $\ell$-torsion point, then there has been significant work done on characterizing the $\ell$-divisibility of the…

Let $d\geq2$ be an integer. Denote by $E_d$ and $E'_{d}$ the hyperelliptic curves over $\mathbb{F}_q$ given by $$E_d: y^2=x^d+ax+b~~~ \text{and} ~~~E'_d: y^2=x^d+ax^{d-1}+b,$$ respectively. We explicitly find the number of…

We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…

We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…

We present an algorithm solving the following problem: given two genus 2 curves over a field k with isogenous Jacobians, compute such an isogeny explicitly. This isogeny can be either an l-isogeny or, in the real multiplication case, an…

Building on Mazur's 1978 work on prime degree isogenies, Kenku determined in 1981 all possible cyclic isogenies of elliptic curves over $\mathbb{Q}$. Although more than 40 years have passed, the determination of cyclic isogenies of elliptic…

An $(f,g)$-semi-matching in a bipartite graph $G=(U \cup V,E)$ is a set of edges $M \subseteq E$ such that each vertex $u\in U$ is incident with at most $f(u)$ edges of $M$, and each vertex $v\in V$ is incident with at most $g(v)$ edges of…

We compute equations for the families of elliptic curves 9-congruent to a given elliptic curve. We use these to find infinitely many non-trivial pairs of 9-congruent elliptic curves over Q, i.e. pairs of non-isogenous elliptic curves over Q…

In his previous papers (Math. Res. Letters 7 (2000), 123--13; Progress in Math. 195 (2001), 473--490; Math. Res. Letters 8 (2001), 429--435; Moscow Math. J. 2 (2002), issue 2, 403-431; Proc. Amer. Math. Soc. 131 (2003), no. 1, 95--102) the…