On elliptic curves \(y^{2} = x^{3}-n^{2}x\) with rank zero (Q1764774): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jnt.2003.12.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042553442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4950461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classical Diophantine problem and modular forms of weight \(3/2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A criterion for elliptic curves with lowest 2-power in L(1) / rank
 
Normal rank

Latest revision as of 18:39, 7 June 2024

scientific article
Language Label Description Also known as
English
On elliptic curves \(y^{2} = x^{3}-n^{2}x\) with rank zero
scientific article

    Statements

    On elliptic curves \(y^{2} = x^{3}-n^{2}x\) with rank zero (English)
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    A positive square-free integer \(n\) is called a congruent number (CN) if \(n\) is the area of some rational right triangular. It is a classical problem to determine when \(n\) is CN or not CN. By Tunnell's work, such problem is equivalent to determine the rank of the rational points of the elliptic curvs \(E_n: y^2=x^3-n^2x\) is zero or not. In this paper, all elliptic curves \(E_n\) of such type with trivial 2-Selmer group and 2-dual Selmer group \(\{ \pm 1, \pm n\}\) are determined in terms of graph language. The rank of rational points of such elliptic curves is always zero. As an application, the non CN with arbitarily many prime divisors can be given, which also extends the first author's previous result. The proof of the paper uses the 2-descent method and reduces the problem to study the Legendre symbol between prime divisors of \(n\). The graph language shows its advantage for this complicated combinatoric question.
    0 references
    0 references
    elliptic curve
    0 references
    Selmer group
    0 references
    congruent number
    0 references
    odd graph
    0 references
    0 references
    0 references