Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Elliptic curves and lower bounds for class numbers (2001.07332v3)

Published 21 Jan 2020 in math.NT

Abstract: Ideal class pairings map the rational points of rank $r\geq 1$ elliptic curves $E/\Q$ to the ideal class groups $\CL(-D)$ of certain imaginary quadratic fields. These pairings imply that $$h(-D) \geq \frac{1}{2}(c(E)-\varepsilon)(\log D){\frac{r}{2}} $$ for sufficiently large discriminants $-D$ in certain families, where $c(E)$ is a natural constant. These bounds are effective, and they offer improvements to known lower bounds for many discriminants.

Summary

We haven't generated a summary for this paper yet.