Computing Elliptic Curves over \mathbb{Q} : Bad Reduction at One Prime
From MaRDI portal
Publication:4604874
Cubic and quartic Diophantine equations (11D25) Elliptic curves over global fields (11G05) Forms of degree higher than two (11E76) Computer solution of Diophantine equations (11Y50) Elliptic curves (14H52) Thue-Mahler equations (11D59) Continued fraction calculations (number-theoretic aspects) (11Y65)
Recommendations
- Computing all elliptic curves over an arbitrary number field with prescribed primes of bad reduction
- Elliptic Curves Over the Rationals with Bad Reduction at Only one Prime
- Computing elliptic curves over \(\mathbb {Q}\)
- Computing elliptic curves having good reduction everywhere over quadratic fields
- scientific article; zbMATH DE number 1522539
- Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes
- scientific article; zbMATH DE number 2152648
- Elliptic curves with few bad primes
- scientific article; zbMATH DE number 3356933
- scientific article; zbMATH DE number 592845
Cites work
- scientific article; zbMATH DE number 4108856 (Why is no real title available?)
- scientific article; zbMATH DE number 44151 (Why is no real title available?)
- scientific article; zbMATH DE number 149292 (Why is no real title available?)
- scientific article; zbMATH DE number 3578903 (Why is no real title available?)
- scientific article; zbMATH DE number 1023655 (Why is no real title available?)
- scientific article; zbMATH DE number 1114504 (Why is no real title available?)
- scientific article; zbMATH DE number 2086891 (Why is no real title available?)
- scientific article; zbMATH DE number 3204773 (Why is no real title available?)
- scientific article; zbMATH DE number 3300651 (Why is no real title available?)
- scientific article; zbMATH DE number 3065066 (Why is no real title available?)
- A fast algorithm to compute cubic fields
- Algorithmic Number Theory
- An effective p-adic analogue of a theorem of Thue III. The diophantine equation $y^2 = x^2 + k$
- Classical diophantine equations
- Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime
- Courbes de Weil semi-stables de discriminant une puissance m-ième.
- Elliptic Curves Over the Rationals with Bad Reduction at Only one Prime
- Elliptic Curves of Conductor 11
- Elliptic Curves of Prime Conductor
- Elliptische Kurven mit vorgeschriebenem Reduktionsverhalten. II
- Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes
- Mordell's equation: a classical approach
- On Néron's classification of elliptic curves of residue characteristics 2 and 3
- On the conductor of an elliptic curve with a rational point of order 2
- On the density of discriminants of cubic fields. II
- On the modularity of elliptic curves over \(\mathbb Q\): wild 3-adic exercises
- On the practical solution of the Thue equation
- On the resolution of Thue inequalities
- Probabilistic algorithm for testing primality
- Reduction of Binary Cubic and Quartic Forms
- Solving a Specific Thue-Mahler Equation
- Strong pseudoprimes to twelve prime bases
- The Magma algebra system. I: The user language
- The Reduction of a Binary Cubic Form (I)
- The behavior of the Mordell-Weil group of elliptic curves
- The number of elliptic curves over \(\mathbb{Q}\) with conductor \(N\)
- The weighted sum of two S-units being a square
Cited in
(9)- Bad Primes in Computational Algebraic Geometry
- Mod-2 dihedral Galois representations of prime conductor
- scientific article; zbMATH DE number 2152648 (Why is no real title available?)
- Computing elliptic curves over \(\mathbb {Q}\)
- Computing all elliptic curves over an arbitrary number field with prescribed primes of bad reduction
- Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes
- Elliptic curves with good reduction outside of the first six primes
- Solving 𝑆-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture
- Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime
This page was built for publication: Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604874)