Derives an efficient algorithm to find solutions to Euler's concordant form problem and rational points on associated elliptic curves.
The initial quadrics for the algorithm are given by (40) Q1 : 2 X 2 0 + X 2 1− X 2 2 = 0, Q 2 : X 2 0 + X 2 1− kX 2 3 = 0
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Algorithm to Find Rational Points on Elliptic Curves Related to the Concordant Form Problem
Derives an efficient algorithm to find solutions to Euler's concordant form problem and rational points on associated elliptic curves.