The statistics of the number of rational points in the hyperelliptic ensemble over a finite field

We study the distribution of the numbers of \({F_{{q^r}}}\)-rational points of hyperelliptic curves over a finite field F_q in odd characteristic. This extends the result of Kurlberg and Rudnick [4]. We also study the distribution of the number of \({F_{{q^r}}}\)-rational points and the trace of high powers of the Frobenius class of real hyperelliptic curves over a finite field F_q in even characteristic.     

Zeta function of the projective curveaY 21 =bX 21 +cZ 21 over a class of finite fields, for odd primesl

Letp andl be rational primes such thatl is odd and the order ofp modulol is even. For such primesp andl, and fore = l, 2l, we consider the non-singular projective curvesaY ²¹ =bX ²¹ +cZ ²¹ defined over finite fields F_q such thatq = p ^α? l(mode).We see that the Fermat curves correspond precisely to those curves among each class (fore = l, 2l), that are maximal or minimal over F_q. We observe that each Fermat prime gives rise to explicit maximal and minimal curves over finite fields of characteristic 2. Fore = 2l, we explicitly determine the ζ -function(s) for this class of curves, over F_q, as rational functions in the variablet, for distinct cases ofa, b, andc, in F _q ^* . Theζ-function in each case is seen to satisfy the Weil conjectures (now theorems) for this concrete class of curves. Fore = l, 2l, we determine the class numbers for the function fields associated to each class of curves over F_q. As a consequence, when the field of definition of the curve(s) is fixed, this provides concrete information on the growth of class numbers for constant field extensions of the function field(s) of the curve(s).     

Constructing pairing-friendly hyperelliptic curves using Weil restriction

A pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding degree with respect to a large prime-order subgroup. In this paper we construct pairing-friendly genus 2 curves over finite fields Fq whose Jacobians are ordinary and simple, but not absolutely simple. We show that constructing such curves is equivalent to constructing elliptic curves over Fq that become pairing-friendly over a finite extension of Fq. Our main proof technique is Weil restriction of elliptic curves. We describe adaptations of the Cocks-Pinch and Brezing-Weng methods that produce genus 2 curves with the desired properties. Our examples include a parametric family of genus 2 curves whose Jacobians have the smallest recorded ρ-value for simple, non-supersingular abelian surfaces.     

Frobenius nonclassicality of Fermat curves with respect to cubics

For Fermat curves F: aX ⁿ + bY ⁿ = Z ⁿ defined over F _q , we establish necessary and sufficient conditions for F to be F _q -Frobenius nonclassical with respect to the linear system of plane cubics. In the new F _q -Frobenius nonclassical cases, we determine explicit formulas for the number N _q (F) of F _q -rational points on F. For the remaining Fermat curves, nice upper bounds for N _q (F) are immediately given by the Stöhr–Voloch Theory.     

An algorithm to compute the number of points on elliptic curves ofj-invariant 0 or 1728 over a finite field

We present an algorithm to compute the number ofF _q -rational points on elliptic curves defined over a finite fieldF _q , withj-invariant 0 or 1728. This algorithm takesO(log³ p) bit operations, werep is the characteristic ofF _q .     

The distribution of class groups of function fields

For any sufficiently general family of curves over a finite field F_q and any elementary abelian ?-group H with ? relatively prime to q, we give an explicit formula for the proportion of curves C for which Jac(C)[?](F_q)≅H. In doing so, we prove a conjecture of Friedman and Washington.     

More Points Than Expected on Curves over Finite Field Extensions

On average, there are q^r+o(q^r/2) F_q^r-rational points on curves of genus g defined over F_q^r. This is also true if we restrict our average to genus g curves defined over F_q, provided r is odd or r>2g. However, if r=2,4,6,… or 2g then the average is q^r+q^r/2+o(q^r/2). We give a number of proofs of the existence of these q^r/2 extra points, and in some cases give a precise formula, but we are unable to provide a satisfactory explanation for this phenomenon.     

Further examples of maximal curves

It is shown that the curve over F_q²ⁿ with n≥3 odd, that generalizes Serre’s curve y⁴+y=x³ over F₆₄, is also maximal. We also investigate a family of maximal curves over F_q²ⁿ and provide isomorphisms between these curves.     

On some questions related to the Gauss conjecture for function fields

We show that, for any finite field Fq, there exist infinitely many real quadratic function fields over Fq such that the numerator of their zeta function is a separable polynomial. As pointed out by Anglès, this is a necessary condition for the existence, for any finite field Fq, of infinitely many real function fields over Fq with ideal class number one (the so-called Gauss conjecture for function fields). We also show conditionally the existence of infinitely many real quadratic function fields over Fq such that the numerator of their zeta function is an irreducible polynomial.     

Enumeration of inequivalent irreducible Goppa codes

We consider irreducible Goppa codes over F_q of length qⁿ defined by polynomials of degree r, where q is a prime power and n,r are arbitrary positive integers. We obtain an upper bound on the number of such codes.     

The Maximum or Minimum Number of Rational Points on Genus Three Curves over Finite Fields

We show that for all finite fields F_q, there exists a curve C over F_q of genus 3 such that the number of rational points on C is within 3 of the Serre–Weil upper or lower bound. For some q, we also obtain improvements on the upper bound for the number of rational points on a genus 3 curve over F_q.with an Appendix by Jean-Pierre Serre     

Solving sparse linear systems of equations over finite fields using bit-flipping algorithm

Let _Fq${\mathbb{F}}_q$ be the finite field with q   elements. We give an algorithm for solving sparse linear systems of equations over _Fq${\mathbb{F}}_q$ when the coefficient matrix of the system has a specific structure, here called relatively connected. This algorithm is based on a well-known decoding algorithm for low-density parity-check codes called bit-flipping algorithm. We modify and extend this hard decision decoding algorithm. The complexity of this algorithm is linear in terms of the number of columns n and the number of nonzero coefficients ω of the matrix per iteration. The maximum number of iterations is bounded above by m, the number of equations.     

Counting hyperelliptic curves

We find a closed formula for the number hyp(g) of hyperelliptic curves of genus g over a finite field k=Fq of odd characteristic. These numbers hyp(g) are expressed as a polynomial in q with integer coefficients that depend on g and the set of divisors of q−1 and q+1. As a by-product we obtain a closed formula for the number of self-dual curves of genus g. A hyperelliptic curve is defined to be self-dual if it is k-isomorphic to its own hyperelliptic twist.     

Pesenti-Szpiro inequality for optimal elliptic curves

We study Pesenti-Szpiro inequality in the case of elliptic curves over F_q(t) which occur as subvarieties of Jacobian varieties of Drinfeld modular curves. In general, we obtain an upper-bound on the degrees of minimal discriminants of such elliptic curves in terms of the degrees of their conductors and q. In the special case when the level is prime, we bound the degrees of discriminants only in terms of the degrees of conductors. As a preliminary step in the proof of this latter result we generalize a construction (due to Gekeler and Reversat) of 1-dimensional optimal quotients of Drinfeld Jacobians.     

Symmetric Polynomials and Some Good Codes

Elements from extensions of F_q are employed to construct a class of linear codes over F_q with good parameters through symmetric polynomials over F_q.     

On the tensor rank of the multiplication in the finite fields

First, we prove the existence of certain types of non-special divisors of degree g−1 in the algebraic function fields of genus g defined over Fq. Then, it enables us to obtain upper bounds of the tensor rank of the multiplication in any extension of quadratic finite fields Fq by using Shimura and modular curves defined over Fq. From the preceding results, we obtain upper bounds of the tensor rank of the multiplication in any extension of certain non-quadratic finite fields Fq, notably in the case of F₂. These upper bounds attain the best asymptotic upper bounds of Shparlinski-Tsfasman-Vladut [I.E. Shparlinski, M.A. Tsfasman, S.G. Vladut, Curves with many points and multiplication in finite fields, in: Lecture Notes in Math., vol. 1518, Springer-Verlag, Berlin, 1992, pp. 145-169].     

Constructing quasi-cyclic codes from linear algebra theory

Let F _q be a finite field of cardinality q, l and m be positive integers and M _l (F _q ) the F _q -algebra of all l × l matrices over F _q . We investigate the relationship between monic factors of X ^m ? 1 in the polynomial ring M _l (F _q )[X] and quasi-cyclic (QC) codes of length lm and index l over F _q . Then we consider the idea of constructing QC codes from monic factors of X ^m ? 1 in polynomial rings over F _q -subalgebras of M _l (F _q ). This idea includes ideas of constructing QC codes of length lm and index l over F _q from cyclic codes of length m over a finite field F _q l, the finite chain ring F _q  + uF _q  + · · · + u ^{l ? 1} F _q (u ^l  = 0) and other type of finite chain rings.     

Surfaces and Curves Corresponding to the Solutions Generated from Periodic“Seed”of NLS Equation

The solutions q [n] generated from a periodic "seed" q = cei(as+bt) of the nonlinear Schrdinger(NLS) by n-fold Darboux transformation is represented by determinant.Furthermore,the s-periodic solution and t-periodic solution are given explicitly by using q [1].The curves and surfaces(F1,F2,F3) associated with q [n] are given by means of Sym formula.Meanwhile,we show periodic and asymptotic properties of these curves.     

Generalized inverses of matrices over fields of characteristic two

For F a field of characteristic two, the problem of determining which m×n matrices of rank r have normalized generalized inverses and which have pseudoinverses is solved. For F_q a finite field of characteristic two, both the number of m×n matrices of rank r over F which have normalized generalized inverses and the number of m×n matrices of rank r over F_q which have pseudoinverses are determined.     

Invariants of finite groups generated by generalized transvections in the modular case

We investigate the invariant rings of two classes of finite groups G ≤ GL(n, F _q) which are generated by a number of generalized transvections with an invariant subspace H over a finite field F _q in the modular case. We name these groups generalized transvection groups. One class is concerned with a given invariant subspace which involves roots of unity. Constructing quotient groups and tensors, we deduce the invariant rings and study their Cohen-Macaulay and Gorenstein properties. The other is concerned with different invariant subspaces which have the same dimension. We provide a explicit classification of these groups and calculate their invariant rings.