相关论文: Counting points on hyperelliptic curves of type $y…

Let p be an odd prime number and g $\ge$ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic…

Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…

This is a survey on recent results on counting of curves over finite fields. It reviews various results on the maximum number of points on a curve of genus g over a finite field of cardinality q, but the main emphasis is on results on the…

In this paper we present a new approach to counting the proportion of hyperelliptic curves of genus $g$ defined over a finite field $\mathbb{F}_q$ with a given $a$-number. In characteristic three this method gives exact probabilities for…

Let $\mathcal{C}$ be a smooth, projective, genus $g\geq 2$ curve, defined over $\mathbb{C}$. Then $\mathcal{C}$ has \emph{many automorphisms} if its corresponding moduli point $p \in \mathcal{M}_g$ has a neighborhood $U$ in the complex…

Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

A new approach has been recently developed to study the arithmetic of hyperelliptic curves $y^2=f(x)$ over local fields of odd residue characteristic via combinatorial data associated to the roots of $f$. Since its introduction, numerous…

We determine all complex hyperelliptic curves with many automorphisms and decide which of their jacobians have complex multiplication.

Let $n$ be an integer such that the modular curve $X_0(n)$ is hyperelliptic of genus $\ge2$ and such that the Jacobian of $X_0(n)$ has rank $0$ over $\mathbb Q$. We determine all points of $X_0(n)$ defined over quadratic fields, and we give…

In this paper we study the Coleman-Oort conjecture for superelliptic curves, i.e., curves defined by affine equations $y^n=F(x)$ with $F$ a separable polynomial. We prove that up to isomorphism there are at most finitely many superelliptic…

We explain how we computed equations for all genus 4 curves defined of the field with 2 elements, up-to-isomorphism, and some of the data we obtained. We give descriptions also of nice models for genus 4 curves over characteristic 2 fields,…

We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…

In this paper, we compute a formula for the $a$-number of curve $\mathbb{X}$ given by the equation $y^{q^2 + q + 1} = x^{q^2 + 1} - x^q$ over the finite field $\mathbb{F}_{q^2}$. The $a$-number is an invariant of the isomorphism class of…

Harron and Snowden counted the number of elliptic curves over $\mathbb{Q}$ up to height $X$ with torsion group $G$ for each possible torsion group $G$ over $\mathbb{Q}$. In this paper we generalize their result to all number fields and all…

We describe an algorithm, based on the properties of the characteristic polynomials of Frobenius, to compute $\operatorname{End}_{\overline{K}}(A)$ when $A$ is the Jacobian of a nice genus-2 curve over a number field $K$. We use this…

This paper presents a formula for $a$-number of certain maximal curves characterized by the equation $y^{\frac{q+1}{2}} = x^m + x$ over the finite field $\mathbb{F}_{q^2}$. $a$-number serves as an invariant for the isomorphism class of the…

Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of…

We present an algorithm that, for every fixed genus $g$, will enumerate all hyperelliptic curves of genus $g$ over a finite field $k$ of odd characteristic in quasilinear time; that is, the time required for the algorithm is…

We introduce a new approach of computing the automorphism group and the field of moduli of points $\p=[C]$ in the moduli space of hyperelliptic curves $\H_g$. Further, we show that for every moduli point $\p \in \H_g(L)$ such that the…

In his previous papers (Math. Res. Letters 7 (2000), 123--13; Math. Res. Letters 8 (2001), 429--435; Moscow Math. J. 2 (2002), issue 2, 403-431) the author proved that in characteristic $\ne 2$ the jacobian $J(C)$ of a hyperelliptic curve…