Computing elliptic curves over $\mathbb {Q}$
From MaRDI portal
Publication:4612572
DOI10.1090/mcom/3370zbMath1468.11123OpenAlexW2800393443MaRDI QIDQ4612572
Adela Gherga, Michael A. Bennett, Andrew Rechnitzer
Publication date: 31 January 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3370
Related Items (4)
Differences between perfect powers: The Lebesgue-Nagell equation ⋮ Rank bias for elliptic curves \(\bmod\,p\) ⋮ Solving 𝑆-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture ⋮ Computing newforms using supersingular isogeny graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the resolution of Thue inequalities
- On Néron's classification of elliptic curves of residue characteristics 2 and 3
- The weighted sum of two S-units being a square
- On the practical solution of the Thue equation
- Probabilistic algorithm for testing primality
- Classical diophantine equations
- The number of elliptic curves over \(\mathbb{Q}\) with conductor \(N\)
- The Magma algebra system. I: The user language
- Zur Approximation algebraischer Zahlen. I: Über den grössten Primteiler binärer Formen
- Modular elliptic curves and Fermat's Last Theorem
- A heuristic for boundedness of ranks of elliptic curves
- An inequality for the discriminant of a polynomial
- On the modularity of elliptic curves over 𝐐: Wild 3-adic exercises
- Strong pseudoprimes to twelve prime bases
- Ellitpic curves and modular functions
- Courbes de Weil semi-stables de discriminant une puissance m-ième.
- Mordell’s equation: a classical approach
- On the conductor of an elliptic curve with a rational point of order 2
- An application of Jensen's formula to polynomials
- Cyclic Cubic Fields of Given Conductor and Given Index
- Elliptic Curves of Conductor 11
- Solving a Specific Thue-Mahler Equation
- Elliptic Curves of Prime Conductor
- Reduction of Binary Cubic and Quartic Forms
- A fast algorithm to compute cubic fields
- Elliptische Kurven mit vorgeschriebenem Reduktionsverhalten. II
- Mod $2$ representations of elliptic curves
- Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime
- Elliptic Curves Over the Rationals with Bad Reduction at Only one Prime
- The behavior of the Mordell-Weil group of elliptic curves
- Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes
- Algorithmic Number Theory
- On the density of discriminants of cubic fields. II
- An effective p-adic analogue of a theorem of Thue III. The diophantine equation $y^2 = x^2 + k$
- Computing All Elliptic Curves Over an Arbitrary Number Field with Prescribed Primes of Bad Reduction
- On the Class-Number of Binary Cubic Forms (I)
- The Reduction of a Binary Cubic Form (I)
- Solving 𝑆-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture
This page was built for publication: Computing elliptic curves over $\mathbb {Q}$
