pith. sign in

arxiv: 1110.4693 · v1 · pith:NKHL4JPNnew · submitted 2011-10-21 · 🧮 math.NT · math.AG

On the distribution of the number of points on a family of curves over finite fields

classification 🧮 math.NT math.AG
keywords mathcalpointsrectangledistributionintegernumberprimearound
0
0 comments X
read the original abstract

Let $p$ be a large prime, $\ell\geq 2$ be a positive integer, $m\geq 2$ be an integer relatively prime to $\ell$ and $P(x)\in\mathbb{F}_p[x]$ be a polynomial which is not a complete $\ell'$-th power for any $\ell'$ for which $GCD(\ell',\ell)=1$. Let $\mathcal{C}$ be the curve defined by the equation $y^{\ell}=P(x)$, and take the points on $\mathcal{C}$ to lie in the rectangle $[0,p-1]^2$. In this paper, we study the distribution of the number of points on $\mathcal{C}$ inside a small rectangle among residue classes modulo $m$ when we move the rectangle around in $[0,p-1]^2$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.