The Maximum Number of Points on a Curve of Genus 4 over is 25 (Q4435707)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2005249
Language Label Description Also known as
default for all languages
No label defined
    English
    The Maximum Number of Points on a Curve of Genus 4 over is 25
    scientific article; zbMATH DE number 2005249

      Statements

      The Maximum Number of Points on a Curve of Genus 4 over is 25 (English)
      0 references
      0 references
      17 November 2003
      0 references
      number of rational points
      0 references
      zeta function
      0 references
      quadric surface
      0 references
      cubic surface
      0 references
      Let \(C\) denote a smooth, geometrically irreducible projective curve of genus 4 defined over the finite field \({\mathbb F}_8\). It was already known that such a curve cannot have more than 27 rational points, and that such curves with 25 rational points do exist. In an appendix to this article, K. Lauter shows that \(C\) cannot have exactly 26 rational points by ruling out all the possible zeta functions such a curve would have. The author shows that \(C\) cannot have 27 rational points, thus establishing that the maximum number of rational points for such a curve is 25. The proof uses the fact that the canonical embedding of \(C\) would be the intersection of an irreducible cubic surface and an irreducible quadric surface in projective 3-space over \({\mathbb F}_8\). Up to isomorphism, there are only three irreducible quadric surfaces in \({\mathbb P}^3\) over a finite field. Let \(Q\) denote one of these quadrics and let \(\text{Fix}(Q)\) denote the subgroup of \(\text{PGL}_4({\mathbb F}_8)\) that leaves \(Q\) invariant. The author shows that if \(S\) is a subset of \(Q\) with 27 rational points, no four of which are collinear, then there exists \(\sigma\in\text{Fix}(Q)\) such that \(\sigma(S)\) contains one of several lists of points of \(Q\). This fact is used to reduce the number of cubics that can also contain these 27 points, resulting in a list of possible cubics that can be searched by a computer. While the computer search turns up many cubics and quadrics that intersect in 27 rational points, none of these intersections gives a geometrically irreducible curve. The author gives a precise accounting of which ``bad'' curves with 27 points can occur.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references