alphaFeedback

WorksMathematics

The Projective Reed-Muller Code from Quartic Curves in the Projective Plane

AI contributions
  • GPT-5.6 Sol · bare
  • GPT-6 Astra
  • GPT-6.1 Sol
View details
Ancillary data
1 code link
View

Abstract

We study the Hamming weight enumerator of the projective Reed-Muller code C2,4\mathcal C_{2,4} over Fq\mathbf F_q, with char⁡(Fq)>3\operatorname{char}(\mathbf F_q)>3. We determine the geometrically reducible and singular contributions by combining incidence counts with counts of plane linear series on a fixed normalization. The line and conic configurations and the genus zero cases give explicit polynomials. The line-cubic and genus one cases give formulas involving class numbers. The genus two contribution is a finite sum over hyperelliptic models, using their point counts over Fq\mathbf F_q and Fq2\mathbf F_{q^2} and their rational Weierstrass points. The remaining smooth contribution is the weighted point count distribution of nonhyperelliptic genus three curves.

Introduction

The Hamming weight enumerator of a linear code CC of length ℓ\ell over Fq\mathbb{F}_q is

WC(X,Y)=∑c∈CXℓ−wt⁡(c)Ywt⁡(c)W_C(X,Y)=\sum_{c\in C}X^{\ell-\operatorname{wt}(c)}Y^{\operatorname{wt}(c)}

where wt⁡(c)\operatorname{wt}(c) is the number of nonzero coordinates of cc. The projective Reed–Muller code Cm,dC_{m,d} is obtained by evaluating the homogeneous degree dd forms in m+1m+1 variables at chosen vector representatives of the points of Pm(Fq)\mathbb{P}^m(\mathbb{F}_q). Changing these representatives gives a monomially equivalent code and preserves its weight enumerator [15, 22, 11]. The zero coordinates of the codeword defined by a form FF are exactly the points of V(F)(Fq)V(F)(\mathbb{F}_q). In the injective range, computing the weight enumerator therefore amounts to counting equations with each possible number of rational zeros.

We consider ternary quartic forms. Throughout the paper, let q=prq=p^r with p>3p>3, fix Fq\mathbb{F}_q, and write Frob⁡q\operatorname{Frob}_q for the qq power Frobenius. Since q≥5q\geq5, projective evaluation in degree four is injective. Thus C2,4C_{2,4} has length q2+q+1q^2+q+1, dimension 1515, and weight enumerator

WC2,4(X,Y)=∑F∈Fq[x0,x1,x2]4X#V(F)(Fq)Yq2+q+1−#V(F)(Fq)W_{C_{2,4}}(X,Y)=\sum_{F\in\mathbb{F}_q[x_0,x_1,x_2]_4}X^{\#V(F)(\mathbb{F}_q)}Y^{q^2+q+1-\#V(F)(\mathbb{F}_q)}

Here V(0)=P2V(0)=\mathbb{P}^2. Nonzero scalar multiples of a form are distinct codewords, although they define the same plane curve.

We call a form reducible if it factors over F‾q\overline{\mathbb{F}}_q. For an absolutely irreducible singular quartic, the normalization has genus two, one, or zero. A smooth plane quartic is a nonhyperelliptic genus three curve in its canonical embedding. Let M3nhyp(Fq)\mathcal{M}_3^{\mathrm{nhyp}}(\mathbb{F}_q) denote representatives of the Fq\mathbb{F}_q-isomorphism classes of such smooth curves, and set

Sq(n)=∑[C]∈M3nhyp(Fq)#C(Fq)=n1#Aut⁡Fq(C).S_q(n)=\sum_{\substack{[C]\in\mathcal{M}_3^{\mathrm{nhyp}}(\mathbb{F}_q)\\ \#C(\mathbb{F}_q)=n}}\frac{1}{\#\operatorname{Aut}_{\mathbb{F}_q}(C)}.

The Hasse–Weil bound gives Sq(n)=0S_q(n)=0 unless ∣n−(q+1)∣≤6q\lvert n-(q+1)\rvert\leq6\sqrt{q}.

Theorem 1.1. The weight enumerator has the decomposition

WC2,4(X,Y)=Xq2+q+1+Wred(X,Y)+Wirr,sing(X,Y)W_{C_{2,4}}(X,Y)=X^{q^2+q+1}+W_{\mathrm{red}}(X,Y)+W_{\mathrm{irr,sing}}(X,Y)
+(q−1)#PGL⁡3(Fq)∑n=0q2+q+1Sq(n)XnYq2+q+1−n.\qquad+(q-1)\#\operatorname{PGL}_3(\mathbb{F}_q)\sum_{n=0}^{q^2+q+1}S_q(n)X^nY^{q^2+q+1-n}.

The reducible and absolutely irreducible singular contributions are determined by explicit polynomials, formulas involving class numbers, and finite sums over hyperelliptic models of genus two curves, as summarized below. The smooth contribution is expressed in terms of Sq(n)S_q(n), which remains unevaluated for general qq.

ContributionArithmetic dataForm of the answer
Line and conic configurationsFinite plane incidence dataExplicit polynomials
Line–cubic and genus one casesElliptic traces and rational two-torsionFormulas involving class numbers
Genus zero normalizationFrobenius action on singular fibersExplicit polynomials
Genus two normalizationPoint counts over Fq\mathbb{F}_q, Fq2\mathbb{F}_{q^2} and rational Weierstrass pointsFinite hyperelliptic model sums
Smooth quarticsNonhyperelliptic genus three point distributionWeighted distribution Sq(n)S_q(n)

Table 1.

Theorem 4.1 gives the expanded formula and identifies each coefficient. The factor (q−1)#PGL⁡3(Fq)(q-1)\#\operatorname{PGL}_3(\mathbb{F}_q) in the smooth term accounts for scalar equations and projective coordinates, with automorphisms accounted for in Sq(n)S_q(n).

For absolutely irreducible singular quartics, the common method is to fix the normalization CC and count base point free degree four plane linear series that give birational maps onto their images. For each singularity profile, Proposition 3.3 converts this count into a count of equations by multiplying by (q−1)#PGL⁡3(Fq)/#Aut⁡Fq(C)(q-1)\#\operatorname{PGL}_3(\mathbb{F}_q)/\#\operatorname{Aut}_{\mathbb{F}_q}(C). The Frobenius action on the singular fibers determines the change in rational point count from CC to its plane model. Thus the geometric count and its contribution to the enumerator are treated in the same way in each genus.

Two parameter spaces make this method particularly concrete. For a genus two curve CC, let Weier⁡(C)(Fq)\operatorname{Weier}(C)(\mathbb{F}_q) denote its rational Weierstrass points, the rational ramification points of the hyperelliptic map. The plane series on CC are parametrized by (Sym⁡2C)(Fq)∖∣KC∣(Fq)(\operatorname{Sym}^2 C)(\mathbb{F}_q)\setminus\lvert K_C\rvert(\mathbb{F}_q). The excluded canonical divisors give double covers of conics, while the remaining divisors are the singular fibers of quartic models. Proposition 3.4 expresses the split node, cusp, and nonsplit node counts using only #C(Fq)\#C(\mathbb{F}_q), #C(Fq2)\#C(\mathbb{F}_{q^2}), and #Weier⁡(C)(Fq)\#\operatorname{Weier}(C)(\mathbb{F}_q). For genus one, projections of an elliptic normal quartic give the parameter space. Proposition 3.5 relates the projection centers to degree two divisors and divisor pairs, identifies the exceptional conic maps, and determines the singular fibers. Counting these data gives the trace shift formulas of Proposition 3.7.

The divisor constructions already occur in Bergström’s classification and count of singular quartics for a sieve used to study the cohomology of genus three moduli spaces. His genus one criterion identifies the degree two maps by the linear equivalence of the two degree two divisors [2 Lemma 13.7]. We use his genus zero counts for two and three geometric singular points [2 Sections 12.3 and 13.4]. For one geometric singular point we give direct derivations using linear series and intrinsic branch data. We also give direct incidence and projection counts for the reducible and genus one cases. We organize these constructions and counts by fixed normalization and trace shift to obtain the coefficients required by this weight enumerator. The line–cubic contribution and the arithmetic evaluation of the elliptic sums use the formulas of Kaplan and Kaplan–Petrow [11, 13].

This continues earlier work on exact weight enumerators of projective Reed–Muller codes. Elkies computed the weight enumerators for quadrics in projective spaces of arbitrary dimension and for cubics in P2\mathbb{P}^2 and P3\mathbb{P}^3 [8]. Aubry obtained related results for projective quadrics [1]. Kaplan studied the weight enumerators of the projective and affine Reed–Muller codes obtained from plane cubics [11]. Kaplan–Matei used the second weight enumerator to count pairs of plane cubics with prescribed rational intersections [12].

The smooth contribution also connects this problem with the study of rational points on genus three curves. Lauter proved that over every finite field there is a genus three curve whose number of rational points lies within three of the Serre–Weil upper or lower bound [16]. The alternative between the two bounds is related to Serre’s obstruction. A principally polarized abelian threefold that is geometrically a Jacobian may require a quadratic twist to become a Jacobian over Fq\mathbb{F}_q, and this twist changes the sign of its Frobenius trace. Ritzenthaler computed this obstruction explicitly and applied it to the existence of optimal genus three curves [20].

This obstruction also appears in the distribution of rational point counts. Quadratic twisting pairs elliptic curves, and likewise hyperelliptic curves, with opposite Frobenius traces. For smooth plane quartics, the quadratic twist of the Jacobian need not be a Jacobian over Fq\mathbb{F}_q, so there is no analogous pairing. Lercier, Ritzenthaler, Rovetta, Sijsling, and Smith gave a heuristic explanation of the observed asymmetry in the trace distribution and its relation to Serre’s obstruction [17]. More recently, Bergström, Howe, Lorenzo García, and Ritzenthaler refined Katz–Sarnak theory by determining limits of moments that measure this asymmetry for nonhyperelliptic curves of genus at least three [4]. Our formulas isolate the distribution Sq(n)S_q(n) from the reducible and singular contributions, making explicit which part of the quartic enumerator depends on these questions about smooth curves.

Section 2 counts the reducible quartics by their geometric components and Frobenius action. The incidence tables are collected in the appendix. Section 3 applies fixed normalization counting in genus two, one, and zero. Section 4 assembles the enumerator, evaluates the elliptic sums by class numbers, and writes the genus two contribution as a finite sum over all squarefree polynomials of degree five or six. SageMath code and saved outputs are maintained in a companion repository.1

Reducible quartic forms

We count nonzero quartic forms that factor over F‾q\overline{\mathbb{F}}_q. The point count depends only on the reduced union of the components. For the line and conic configurations, we count equations up to multiplication by a nonzero scalar using incidence arguments. We treat the line and cubic case using the affine cubic weight enumerator. The full incidence tables are in Section A. We describe the counting methods below.

Line and conic configurations

For quartics with four line factors, the configurations and their counts are listed in Table A.1. We check the total independently by choosing Frobenius orbits of lines, allowing repetitions. Let ndn_d be the number of such orbits of length dd. There are q2d+qd+1q^{2d}+q^d+1 lines over Fqd\mathbb{F}_{q^d}, since lines are points of the dual plane. Removing the lines defined over proper subfields and dividing by dd gives n1=q2+q+1n_1=q^2+q+1, n2=(q4−q)/2n_2=(q^4-q)/2, n3=(q6+q3−q2−q)/3n_3=(q^6+q^3-q^2-q)/3, and n4=(q8−q2)/4n_4=(q^8-q^2)/4. The orbit lengths, counted with repetition, form one of the partitions 1+1+1+11+1+1+1, 2+1+12+1+1, 2+22+2, 3+13+1, or 44. These give the five terms in the total

(n1+34)+n2(n1+12)+(n2+12)+n1n3+n4=q8+q7+2q6+2q5+3q4+2q3+2q2+q+1.\binom{n_1+3}{4}+n_2\binom{n_1+1}{2}+\binom{n_2+1}{2}+n_1n_3+n_4 = q^8+q^7+2q^6+2q^5+3q^4+2q^3+2q^2+q+1.

This agrees with the sum of all 21 rows of Table A.1.

There are q5−q2q^5-q^2 smooth conics over Fq\mathbb{F}_q, each with q+1q+1 rational points. A fixed smooth conic has q+1q+1 rational tangent lines, q(q+1)/2q(q+1)/2 rational lines meeting it in two rational points, and q(q−1)/2q(q-1)/2 rational lines meeting it in no rational point. These counts give Table A.2 directly. For two distinct rational lines, choose an unordered pair of the required types and separate the pairs whose intersection lies on the conic. Inclusion and exclusion then gives Table A.3.

A pair of nonrational conjugate lines has just one rational point, their intersection. Each rational point lies on (q2−q)/2(q^2-q)/2 such pairs. For a fixed smooth conic, choosing this point on or off the conic gives Table A.5.

For two distinct smooth conics, we need only the number rr of distinct rational intersection points. Bézout gives 0≤r≤40\le r\le4. A tangency contributes one point to rr. If both conics are defined over Fq\mathbb{F}_q, their union has 2q+2−r2q+2-r rational points. If they are conjugate over Fq2\mathbb{F}_{q^2}, a rational point on either conic also lies on its conjugate, so their union has exactly rr rational points.

We count the two families by the same procedure: choose some rational intersection points, count pairs through them, and remove pairs with more intersection points. For 0≤i≤40\le i\le4, let aia_i be the number of subsets of ii points in P2(Fq)\mathbb{P}^2(\mathbb{F}_q) with no three collinear, and let ci(q)c_i(q) be the number of smooth conics through any one such subset. The elementary counts are

References

  1. [1]Y. Aubry. Reed–Muller codes associated to projective algebraic varieties. In Coding Theory and Algebraic Geometry (Luminy, 1991), volume 1518 of Lecture Notes in Mathematics, pages 4–17, Berlin. Springer, 1992.DOI
  2. [2]J. Bergström. Cohomology of moduli spaces of curves of genus three via point counts. Journal für die reine und angewandte Mathematik, 622:155–187, 2008. DOI: 10.1515/CRELLE.2008.068.DOI
  3. [3]J. Bergström. Equivariant counts of points of the moduli spaces of pointed hyperelliptic curves. Documenta Mathematica, 14:259–296, 2009.arxiv.org/abs/math/0611813
  4. [4]J. Bergström, E. W. Howe, E. Lorenzo García, and C. Ritzenthaler. Refinements of Katz–Sarnak theory for the number of points on curves over finite fields. Canadian Journal of Mathematics, 77(2):400–425, 2025. DOI: 10.4153/S0008414X2400004X.DOI
  5. [5]A. Campillo. Algebroid Curves in Positive Characteristic, volume 813 of Lecture Notes in Mathematics. Springer, Berlin, 1980. DOI: 10.1007/BFb0090823.DOI
  6. [6]D. A. Cox, A. R. Kustin, C. Polini, and B. Ulrich. A Study of Singularities on Rational Curves via Syzygies, volume 222 of Memoirs of the American Mathematical Society. American Mathematical Society, Providence, RI, 2013. DOI: 10.1090/S0065-9266-2012-00674-5. No. 1045.
  7. [7]D. Eisenbud and J. Harris. The Practice of Algebraic Curves: A Second Course in Algebraic Geometry, volume 250 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2024.
  8. [8]N. D. Elkies. Linear codes and algebraic geometry in higher dimensions. Preprint, 2006.
  9. [9]X. Faber, J. Grantham, and E. W. Howe. On the maximum gonality of a curve over a finite field. Algebra & Number Theory, 19(8):1637–1662, 2025. DOI: 10.2140/ant.2025.19.1637.DOI
  10. [10]G.-M. Greuel and H. D. Nguyen. Right Simple Singularities in Positive Characteristic. Journal für die reine und angewandte Mathematik, 712:81–106, 2016. DOI: 10.1515/crelle-2013-0118.
  11. [11]N. Kaplan. Weight Enumerators of Reed–Muller Codes from Cubic Curves and Their Duals. In Y. Aubry, E. W. Howe, and C. Ritzenthaler, editors, Arithmetic Geometry: Computation and Applications. Volume 722, Contemporary Mathematics, pages 59–77. American Mathematical Society, Providence, RI, 2019. DOI: 10.1090/conm/722/14535.DOI
  12. [12]N. Kaplan and V. Matei. Counting plane cubic curves over finite fields with a prescribed number of rational intersection points. European Journal of Mathematics, 7(3):1137–1181, 2021. DOI: 10.1007/s40879-021-00472-x.DOI
  13. [13]N. Kaplan and I. Petrow. Elliptic curves over a finite field and the trace formula. Proceedings of the London Mathematical Society. 3rd series, 115(6):1317–1372, 2017. DOI: 10.1112/plms.12069.DOI
  14. [14]E. Kunz. Introduction to Plane Algebraic Curves. Birkhäuser, Boston, MA, 2005. DOI: 10.1007/0-8176-4443-1.
  15. [15]G. Lachaud. The parameters of projective Reed–Muller codes. Discrete Mathematics, 81(2):217–221, 1990. DOI: 10.1016/0012-365X(90)90155-B.DOI
  16. [16]K. Lauter. The Maximum or Minimum Number of Rational Points on Genus Three Curves over Finite Fields. Compositio Mathematica, 134(1):87–111, 2002. DOI: 10.1023/A:1020246226326. With an appendix by Jean-Pierre Serre.DOI
  17. [17]R. Lercier, C. Ritzenthaler, F. Rovetta, J. Sijsling, and B. Smith. Distributions of traces of Frobenius for smooth plane curves over finite fields. Experimental Mathematics, 28(1):39–48, 2019. DOI: 10.1080/10586458.2017.1328321.
  18. [18]Q. Liu. Algebraic Geometry and Arithmetic Curves, volume 6 of Oxford Graduate Texts in Mathematics. Oxford University Press, Oxford, 2002.
  19. [19]H. D. Nguyen. Invariants of plane curve singularities and Plücker formulas in positive characteristic. Annales de l’Institut Fourier, 66(5):2047–2066, 2016. DOI: 10.5802/aif.3057.DOI
  20. [20]C. Ritzenthaler. Explicit computations of Serre’s obstruction for genus 3 curves and application to optimal curves. LMS Journal of Computation and Mathematics, 13:192–207, 2010. DOI: 10.1112/S1461157009000576.DOI
  21. [21]R. Schoof. Nonsingular plane cubic curves over finite fields. Journal of Combinatorial Theory, Series A, 46(2):183–211, 1987. DOI: 10.1016/0097-3165(87)90003-3.DOI
  22. [22]A. B. Sørensen. Projective Reed–Muller codes. IEEE Transactions on Information Theory, 37(6):1567–1576, 1991. DOI: 10.1109/18.104317.DOI
  23. [23]The Stacks Project Authors. The Stacks Project. https://stacks.math.columbia.edu, 2026.

Paper details

vlnc:W_j8685gx9
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

GPT-5.6 Sol (bare), GPT-6 Astra, GPT-6.1 Sol · View statement →

Looking for related papers…
Contents