2008
DOI: 10.1515/jmc.2008.008
|View full text |Cite
|
Sign up to set email alerts
|

Counting hyperelliptic curves that admit a Koblitz model

Abstract: Abstract. Let k = Fq be a finite field of odd characteristic. We find a closed formula for the number of k-isomorphism classes of pointed, and non-pointed, hyperelliptic curves of genus g over k, admitting a Koblitz model. These numbers are expressed as a polynomial in q with integer coefficients (for pointed curves) and rational coefficients (for nonpointed curves). The coefficients depend on g and the set of divisors of q − 1 and q + 1. These formulas show that the number of hyperelliptic curves of genus g s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…For instance, this technique has been used in the papers [3] and [11] to count, for any given value of the genus g > 1, the number of k-isomorphism classes of hyperelliptic curves, of pointed hyperelliptic curves, and of hyperelliptic curves having a rational Weierstrass point. N = 1, 2 The description of the subtypes of conjugacy classes of PGL N +1 (k) and the computation of the coefficients c α can be deduced from [7, Proposition 2.3, Lemma 2.4] for N = 1 and from [9, for N = 2.…”
Section: Theorem 34 For a Fixed Value Of N 1 The Generating Functimentioning
confidence: 99%
“…For instance, this technique has been used in the papers [3] and [11] to count, for any given value of the genus g > 1, the number of k-isomorphism classes of hyperelliptic curves, of pointed hyperelliptic curves, and of hyperelliptic curves having a rational Weierstrass point. N = 1, 2 The description of the subtypes of conjugacy classes of PGL N +1 (k) and the computation of the coefficients c α can be deduced from [7, Proposition 2.3, Lemma 2.4] for N = 1 and from [9, for N = 2.…”
Section: Theorem 34 For a Fixed Value Of N 1 The Generating Functimentioning
confidence: 99%