English
Related papers

Related papers: Finding elliptic curves with a subgroup of prescri…

200 papers

Let K be a totally real Galois number field and let A be a set of elliptic curves over K. We give sufficient conditions for the existence of a finite computable set of rational primes P such that for p not in P and E in A, the…

Number Theory · Mathematics 2014-07-17 Nuno Freitas , Samir Siksek

We give some heuristics for counting elliptic curves with certain properties. In particular, we re-derive the Brumer-McGuinness heuristic for the number of curves with positive/negative discriminant up to $X$, which is an application of…

Number Theory · Mathematics 2007-05-23 Mark Watkins

The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained open was whether…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-27 Keren Censor-Hillel , Dean Leitersdorf , David Vulakh

We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…

Number Theory · Mathematics 2019-02-20 François Morain , Charlotte Scribot , Benjamin Smith

We find all elliptic curves defined over $\mathbb{Q}$ that have a rational point of order $N$, $N\ge 4$, and whose conductor is of the form $p^aq^b$, where p, q are two distinct primes, a, b are two positive integers. In particular, we…

Number Theory · Mathematics 2013-10-30 Mohammad Sadek

An isogeny class of elliptic curves over a finite field is determined by a quadratic Weil polynomial. Gekeler has given a product formula, in terms of congruence considerations involving that polynomial, for the size of such an isogeny…

Number Theory · Mathematics 2016-12-14 Jeff Achter , Julia Gordon , Salim Ali Altug

For positive integers $K$ and $L$, we introduce and study the notion of $K$-multiplicative dependence over the algebraic closure $\overline{\mathbb{F}}_p$ of a finite prime field $\mathbb{F}_p$, as well as $L$-linear dependence of points on…

Number Theory · Mathematics 2021-06-15 Fabrizio Barroero , Laura Capuano , László Mérai , Alina Ostafe , Min Sha

Let $E$ be an elliptic curve without complex multiplication defined over the rationals. The purpose of this article is to define a positive integer $A(E)$, that we call the {\it Serre's constant associated to $E$}, that gives necessary…

Number Theory · Mathematics 2024-02-09 Harris B. Daniels , Enrique González-Jiménez

For a prime $p{\,>\,}3$ and a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$ with ${j(E)\notin\{0,1728\}}$, consider an endomorphism $\alpha$ of $E$ represented as a composition of $L$ isogenies of degree at most $d$. We…

Number Theory · Mathematics 2025-01-28 Travis Morrison , Lorenz Panny , Jana Sotáková , Michael Wills

We establish a conditional equivalence between quantitative unboundedness of the analytic rank of elliptic curves over $\mathbb Q$ and the existence of highly biased elliptic curve prime number races. We show that conditionally on a Riemann…

Number Theory · Mathematics 2013-05-01 Daniel Fiorilli

We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely…

Machine Learning · Computer Science 2015-07-01 Rasmus Kyng , Anup Rao , Sushant Sachdeva , Daniel A. Spielman

Let E be a non-CM elliptic curve defined over Q. For each prime p of good reduction, E reduces to a curve E_p over the finite field F_p. For a given squarefree polynomial f(x,y), we examine the sequences f_p(E) := f(a_p(E), p), whose values…

Number Theory · Mathematics 2013-05-03 Shabnam Akhtari , Chantal David , Heekyoung Hahn , Lola Thompson

This paper studies the task of two-sources randomness extractors for elliptic curves defined over finite fields $K$, where $K$ can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which…

Cryptography and Security · Computer Science 2014-08-27 Abdoul Aziz Ciss

For a given elliptic curve, its associated $L$-function evaluated at $1$ is closely related to its real period. In this article, we generalize this principle to a rational curve. We count the rational points over all finite fields and use…

Number Theory · Mathematics 2019-12-02 Brecken Beers , Yih Sung

Let $E_1$ and $E_2$ be elliptic curves in Legendre form with integer parameters. We show there exists a constant $C$ such that for almost all primes, for all but at most $C$ pairs of points on the reduction of $E_1 \times E_2$ modulo $p$…

Number Theory · Mathematics 2020-08-04 Bryce Kerr , Jorge Mello , Igor E. Shparlinski

All known algorithms for the Fr\'echet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values.…

Computational Geometry · Computer Science 2016-08-11 Kevin Buchin , Maike Buchin , Rolf van Leusden , Wouter Meulemans , Wolfgang Mulzer

We prove several results regarding some invariants of elliptic curves on average over the family of all elliptic curves inside a box of sides $A$ and $B$. As an example, let $E$ be an elliptic curve defined over $\mathbb{Q}$ and $p$ be a…

Number Theory · Mathematics 2014-04-24 Amir Akbary , Adam Tyler Felix

We define linearly reducible elliptic Feynman integrals, and we show that they can be algorithmically solved up to arbitrary order of the dimensional regulator in terms of a 1-dimensional integral over a polylogarithmic integrand, which we…

High Energy Physics - Phenomenology · Physics 2019-01-17 Martijn Hidding , Francesco Moriello

In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time…

Number Theory · Mathematics 2008-01-25 Rene Schoof

Let E/k(T) be an elliptic curve defined over a rational function field of characteristic zero. Fix a Weierstrass equation for E. For points R in E(k(T)), write x_R=A_R/D_R^2 with relatively prime polynomials A_R(T) and D_R(T) in k[T]. The…

Number Theory · Mathematics 2007-07-09 Joseph H. Silverman