Questions, not proof records

Open-problem statements, with their sources attached.

Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.

“Open” is a dated source assertion. In these pinned sources, sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.
1 topic

46 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openWikipedia · Number theory

Some conjectures about ranks of elliptic curves over ℚ

From [PPVW2016], Section 3.1: "from the mid-1960s to the present, it seems that most experts conjectured unboundedness."

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Some conjectures about ranks of elliptic curves over ℚ

From [PPVW2016], Section 8.2: "Our heuristic predicts (a) All but finitely many E ∈ ℰ satisfy rk E(ℚ) ≤ 21". In other words, there are only finitely many elliptic curves over ℚ (up to isomorphism) with rank greater than 21. Notice that this contradicts the previous conjecture.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Some conjectures about ranks of elliptic curves over ℚ

[PPVW2016] 8.2(b): for 1 ≤ r ≤ 20, the number of elliptic curves over ℚ with rank r and naïve height at most H is asymptotically H ^ ((21 - r) / 24 + o(1)). Note: ℰ_H in 8.2(b) should be ℰ_{≤H}, see the statement of Theorem 7.3.3. When r = 1, the exponent is 20 / 24 = 5 / 6, which agrees with the exponent in card_heightLE_div_pow_five_div_six_tensto and is consistent with half_rank_zero_and_half_rank_one.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Some conjectures about ranks of elliptic curves over ℚ

[PPVW2016] 8.2(c): the number of elliptic curves over ℚ with rank ≥ 21 and naïve height at most H is asymptotically at most H ^ o(1).

Source checked Jul 26, 20261 pinned Lean statementInspect problem