Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 70 tok/s
Gemini 2.5 Pro 45 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 102 tok/s Pro
Kimi K2 212 tok/s Pro
GPT OSS 120B 466 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

The frequency of elliptic curve groups over prime finite fields (1405.6923v2)

Published 27 May 2014 in math.NT

Abstract: Letting $p$ vary over all primes and $E$ vary over all elliptic curves over the finite field $\mathbb{F}p$, we study the frequency to which a given group $G$ arises as a group of points $E(\mathbb{F}_p)$. It is well-known that the only permissible groups are of the form $G{m,k}:=\mathbb{Z}/m\mathbb{Z}\times \mathbb{Z}/mk\mathbb{Z}$. Given such a candidate group, we let $M(G_{m,k})$ be the frequency to which the group $G_{m,k}$ arises in this way. Previously, the second and fourth named authors determined an asymptotic formula for $M(G_{m,k})$ assuming a conjecture about primes in short arithmetic progressions. In this paper, we prove several unconditional bounds for $M(G_{m,k})$, pointwise and on average. In particular, we show that $M(G_{m,k})$ is bounded above by a constant multiple of the expected quantity when $m\le kA$ and that the conjectured asymptotic for $M(G_{m,k})$ holds for almost all groups $G_{m,k}$ when $m\le k{1/4-\epsilon}$. We also apply our methods to study the frequency to which a given integer $N$ arises as the group order $#E(\mathbb{F}_p)$.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.