A card from a free library — ask anything, no account, works offline. Every card carries its source.
If Sha is finite, the rank is computable
joint
Manin (1971): if the Tate-Shafarevich group is finite - part of what BSD asserts - then the rank of an elliptic curve over Q is effectively computable by descent. Without it, no algorithm is known. A conjecture in arithmetic that would decide a question in computation.
source
Narrow Highway - the Millennium floor, a joint found in the literature (operator seed)
card id
card_joint_manin_algorithm
address
WIT.codex.EXP/if-sha-is-finite-the-rank-is-computable/REF.WITNESSED@narrow-highway-the-mille
adjoining cards
- part of → The Millennium floor - seven open questions, and where they connect — a joint that is proven or observed - a part of the floor
- connects at → The Birch and Swinnerton-Dyer conjecture — If Sha is finite, the rank is computable. manin 1971. Cited, not sealed: no arithmetic to
- connects at → P versus NP — If Sha is finite, the rank is computable. manin 1971. Cited, not sealed: no arithmetic to
- cites → Yu. I. Manin 1971 — Cyclotomic fields and modular curves — the record the joint stands on
Is this card incomplete? Tell the library — it will call out for more ↗