Counting Plane Cubic Curves over Finite Fields with a Prescribed Number of Rational Intersection Points

preprint2021arXivOpen access

Abstract

For each integer k∈[0,9]k \in [0,9], we count the number of plane cubic curves defined over a finite field Fq\mathbb{F}_q that do not share a common component and intersect in exactly k Fqk\ \mathbb{F}_q-rational points. We set this up as a problem about a weight enumerator of a certain projective Reed-Muller code. The main inputs to the proof include counting pairs of cubic curves that do share a common component, counting configurations of points that fail to impose independent conditions on cubics, and a variation of the MacWilliams theorem from coding theory.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.