pith. sign in

arxiv: 2604.18954 · v2 · pith:LT3MDIT2new · submitted 2026-04-21 · 🧮 math.NT

Classification of Rational Functions of Degree Three over Finite Fields

Xiang-dong Hou , Siyu Peng , Yongyu Qiang , Shujun Zhao This is my paper

Pith reviewed 2026-05-21 01:17 UTC · model grok-4.3

classification 🧮 math.NT
keywords rational functionsfinite fieldsPGL-equivalencedegree threeodd characteristicvalue frequenciesramification pointsequivalence classes
0
0 comments X

The pith

All rational functions of degree three over finite fields of odd characteristic are classified up to PGL-equivalence.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper sets out to list every rational function of degree three over a finite field of odd characteristic, where two functions count as the same if one is obtained from the other by pre- and post-composition with degree-one maps. A sympathetic reader would care because these maps appear throughout coding theory, cryptography, and the arithmetic of function fields, and reducing them to a short list of representatives removes redundant casework. The classification rests on two concrete invariants: the value frequency, which records how many times each field element is attained, and the ramification points, which mark where the map fails to be locally one-to-one. The authors close the list by matching the enumerated representatives against an independent formula that counts the total number of classes.

Core claim

Rational functions of degree three over finite fields in odd characteristic are classified under the equivalence relation of pre- and post-composition with degree-one rational functions. The authors achieve the classification by analyzing the value frequencies and the ramification points of each such function. Completion of the list also uses an explicit formula for the number of equivalence classes obtained in earlier work by the first author.

What carries the argument

PGL-equivalence of rational functions, equipped with the two invariants of value frequency and ramification points.

If this is right

  • Every equivalence class possesses a normal form that can be used to test properties preserved by the equivalence.
  • The total number of classes is now known exactly for every odd-characteristic finite field.
  • Applications that employ degree-three rational functions over finite fields can restrict attention to the listed representatives.
  • Further invariants or constructions can be checked case-by-case against the finite list rather than against all possible maps.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same combination of frequency and ramification analysis might be tried on degree-four rational functions to see whether a comparable classification emerges.
  • The explicit list supplies a finite menu of test cases for conjectures about the distribution of rational maps in arithmetic geometry.
  • One could verify the result computationally for the smallest fields and thereby obtain a concrete check on both the invariants and the counting formula.

Load-bearing premise

The classification is finished by matching representatives against a previously derived formula that counts the total number of equivalence classes.

What would settle it

Enumerate every degree-three rational function over a small odd-characteristic field such as F_5 or F_7, compute its value frequency and ramification data, and check whether every orbit matches one of the listed classes while the total number of orbits equals the counting formula.

read the original abstract

We study rational functions over finite fields under PGL-equivalence. We say that $f, g \in \Bbb F_q(X)$ are \emph{equivalent} if there exist $\psi, \phi \in \Bbb F_q(X)$ of degree one such that $g = \psi \circ f \circ \phi$. Most properties of rational functions over finite fields as they appear in theory and applications are preserved under this equivalence. In a recent work, Mattarei and Pizzato classified rational functions of degree three over finite fields in even characteristic. In the present paper, we classify all rational functions of degree three over finite fields in odd characteristic. Our approach is based on careful analyses of the value frequencies and the ramification points of the degree three rational functions. The completion of our classification also relies on an explicit formula for the number of equivalence classes of degree three rational functions over finite fields recently obtained by the first author.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper classifies all rational functions of degree three over finite fields of odd characteristic up to PGL-equivalence. It proceeds by analyzing value frequencies and ramification points to produce representatives of equivalence classes, then invokes an explicit formula for the total number of such classes (derived by the first author in prior work) to conclude that the list is exhaustive. This complements the even-characteristic classification of Mattarei and Pizzato.

Significance. If the representatives are correctly identified and the count matches without omissions or duplicates, the result completes the classification of degree-3 rational functions over finite fields. This contributes to the structural theory of rational maps over finite fields, with potential relevance to permutation polynomials, function fields, and applications in finite geometry or coding theory. The use of value-frequency and ramification data offers a concrete method that could extend to related problems.

major comments (2)
  1. [Abstract] Abstract and the paragraph on the completion of the classification: the exhaustiveness claim rests on matching the enumerated classes to the explicit count formula from the first author's recent work. Without an explicit verification step—such as a table comparing the number of representatives found via value frequencies and ramification to the formula, or a direct enumeration for small odd q (e.g., q=3,5,7)—it is not shown that the listed orbits partition exactly into the predicted number, leaving open the possibility of incompleteness or duplication.
  2. [Ramification analysis] The section describing the ramification-point analysis: the possible ramification configurations for degree-3 functions in odd characteristic must be shown to produce distinct equivalence classes under the PGL action, with a clear accounting of how many classes arise from each type; otherwise the partition into orbits cannot be confirmed to be complete.
minor comments (2)
  1. The abstract refers to 'careful analyses' of value frequencies; the main text should include at least one fully worked example for a small field showing the frequency distribution, the resulting representative, and its ramification data.
  2. [References] All citations to the first author's prior formula should include the precise reference (arXiv number or journal details) and a brief statement of the assumptions under which the count was derived.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and for the constructive comments. We address each major comment below and outline the revisions we will make to strengthen the presentation of the classification.

read point-by-point responses

  1. Referee: [Abstract] Abstract and the paragraph on the completion of the classification: the exhaustiveness claim rests on matching the enumerated classes to the explicit count formula from the first author's recent work. Without an explicit verification step—such as a table comparing the number of representatives found via value frequencies and ramification to the formula, or a direct enumeration for small odd q (e.g., q=3,5,7)—it is not shown that the listed orbits partition exactly into the predicted number, leaving open the possibility of incompleteness or duplication.

    Authors: We agree that making the verification step more explicit will improve clarity. In the revised version we will add a summary table that records, for each combination of value-frequency type and ramification configuration, the number of distinct PGL-orbits obtained by our normalization procedure. The row totals will be summed and compared directly with the closed-form count from the first author’s earlier paper. In addition, we will include a short computational check for the smallest odd characteristics q = 3, 5 and 7, listing all representatives found by exhaustive search and confirming that their number and orbit types match the table. These additions will render the exhaustiveness argument fully explicit without altering the logical structure of the proof. revision: yes

  2. Referee: [Ramification analysis] The section describing the ramification-point analysis: the possible ramification configurations for degree-3 functions in odd characteristic must be shown to produce distinct equivalence classes under the PGL action, with a clear accounting of how many classes arise from each type; otherwise the partition into orbits cannot be confirmed to be complete.

    Authors: The ramification analysis already enumerates all admissible configurations (determined by the possible ramification indices and the characteristic being odd) and, for each configuration, normalizes the locations of the ramification points via a suitable element of PGL(2, F_q). Distinct configurations are separated either by their ramification data or by the associated value-frequency vectors; within a fixed configuration the normalization produces a finite list of canonical representatives whose mutual inequivalence follows from the fact that any PGL-equivalence would have to preserve the normalized ramification points. To make the accounting transparent we will insert a short subsection (or a displayed table) that states, for every ramification type, the precise number of orbits obtained after normalization. This will confirm that the orbits arising from different types are disjoint and that their union exhausts the set counted by the formula. revision: partial

Circularity Check

1 steps flagged

Classification completeness hinges on matching enumerated classes to the first author's prior count formula

specific steps
  1. self citation load bearing [Abstract]
    "The completion of our classification also relies on an explicit formula for the number of equivalence classes of degree three rational functions over finite fields recently obtained by the first author."

    The paper presents a classification obtained from direct analyses but completes the claim of exhaustiveness by matching the enumerated orbits to a count previously derived by the first author alone. This reduces the assertion that the list contains all classes (and no duplicates) to the correctness of that self-cited formula.

full rationale

The paper derives representatives via value-frequency and ramification analyses, then invokes a prior explicit formula for the total number of PGL-orbits (obtained by the first author) to assert that the list is exhaustive. This makes the central completeness claim dependent on a self-cited result whose own derivation is not re-verified here. No independent cross-check such as direct enumeration for small q is described, elevating the self-citation to load-bearing status for the classification claim.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on standard algebraic properties of rational functions and the PGL action together with the self-cited count formula; no new free parameters or invented entities are introduced.

axioms (1)
  • standard math Standard properties of the action of PGL(2) on rational functions over finite fields and the definition of ramification points.
    Invoked throughout the analyses of value frequencies and ramification.

pith-pipeline@v0.9.0 · 5696 in / 1163 out tokens · 35979 ms · 2026-05-21T01:17:45.325586+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    Ahmadi,Generalization of a theorem of Carlitz, Finite Fields Appl.17(2011), 473 – 480

    O. Ahmadi,Generalization of a theorem of Carlitz, Finite Fields Appl.17(2011), 473 – 480

    work page 2011

  2. [2]

    L. E. Dickson,Criteria for the irreducibility of functions in a finite field, Bull. Amer. Math. Soc.13(1906), 1-8

    work page 1906

  3. [3]

    Ding and M

    Z. Ding and M. E. ZieveLow-degree permutation rational functions over finite fields, Acta Arithmetica202(2022), 253 – 280. 48 X. HOU, S. PENG, Y. QIANG, AND S. ZHAO

    work page 2022

  4. [4]

    Ferraguti and G

    A. Ferraguti and G. Micheli,Full Classification of permutation rational functions and com- plete rational functions of degree three over finite fields, Designs, Codes and Cryptography 88(2020) 867 – 886

    work page 2020

  5. [5]

    Hou,Permutation polynomials over finite fields — a survey of recent advances, Finite Fields Appl.32(2015), 82 – 119

    X. Hou,Permutation polynomials over finite fields — a survey of recent advances, Finite Fields Appl.32(2015), 82 – 119

    work page 2015

  6. [6]

    Hou,Lectures on Finite Fields, Graduate Studies in Mathematics, vol

    X. Hou,Lectures on Finite Fields, Graduate Studies in Mathematics, vol. 190, American Mathematical Society, Providence, RI, 2018

    work page 2018

  7. [7]

    Hou,Rational functions of degree four that permute the projective line over a finite field, Comm

    X. Hou,Rational functions of degree four that permute the projective line over a finite field, Comm. Algebra49(2021), 3798 – 3809

    work page 2021

  8. [8]

    Hou,A power sum formula by Carlitz and its applications to permutation rational func- tions of finite fields, Cryptogr

    X. Hou,A power sum formula by Carlitz and its applications to permutation rational func- tions of finite fields, Cryptogr. Commun.13(2021), 681 – 694

    work page 2021

  9. [9]

    X, Hou,Number of equivalence classes of rational functions over finite fields, Acta Arith- metica, Published online 17 March 2025

    work page 2025

  10. [10]

    D. R. Kohel and I. E. Shparlinski.On exponential sums and group genera- tors for elliptic curves over finite fields, In: Algorithmic Number Theory, Ed. W. Bosma, Springer Berlin Heidelberg, 2000, pp. 395 – 404

    work page 2000

  11. [11]

    Mattarei and M

    S. Mattarei and M. Pizzato,Generalizations of self-reciprocal polynomials, Finite Fields Appl. 48(2017), 271 – 288

    work page 2017

  12. [12]

    Mattarei and M

    S. Mattarei and M. Pizzato,Irreducible polynomials from a cubic transformation, Finite Fields Appl.84(2022), Article 102111

    work page 2022

  13. [13]

    Mattarei and M

    S. Mattarei and M. Pizzato,Cubic rational expressions over a finite field, J. Algebra Appl., art. 2550319 (Online Ready, 2024)

    work page 2024

  14. [14]

    Panario, L

    D. Panario, L. Reis, Q. Wang,Construction of irreducible polynomials through rational trans- formations, J. Pure Appl. Alg.224(2020), Article 106241

    work page 2020

  15. [15]

    Reis,M¨ obius-like maps on irreducible polynomials and rational transformations, J

    L. Reis,M¨ obius-like maps on irreducible polynomials and rational transformations, J. Pure Appl. Alg.224(2020), 169 – 180

    work page 2020

  16. [16]

    Reis,On the existence and number of invariant polynomials, Finite Fields Appl.61(2020), Article 101605

    L. Reis,On the existence and number of invariant polynomials, Finite Fields Appl.61(2020), Article 101605

    work page 2020

  17. [17]

    Stichtenoth,Algebraic function fields and codes, 2nd ed., Grad

    H. Stichtenoth,Algebraic function fields and codes, 2nd ed., Grad. Texts Math., vol. 254, Berlin: Springer, 2009

    work page 2009

  18. [18]

    Stichtenoth and A

    H. Stichtenoth and A. Topuzo˘ glu,Factorization of a class of polynomials over finite fields, Finite Fields Appl.18(2012), 108 – 122

    work page 2012

  19. [19]

    Sze,Rational Functions of Degree Five That Permute the Projective Line Over a Finite Field, Ph.D

    C. Sze,Rational Functions of Degree Five That Permute the Projective Line Over a Finite Field, Ph.D. Dissertation, University of South Florida, 2023

    work page 2023

  20. [20]

    Wang,Polynomials over finite fields: an index approach, in Combinatorics and Fi- nite Fields: Difference Sets, Polynomials, Pseudorandomness and Applications, Eds: K-U

    Q. Wang,Polynomials over finite fields: an index approach, in Combinatorics and Fi- nite Fields: Difference Sets, Polynomials, Pseudorandomness and Applications, Eds: K-U. Schmidt and A. Winterhof, De Gruyter, Berlin, Boston, 2019, pp. 319 – 348. Department of Mathematics and Statistics, University of South Florida, Tampa, FL 33620 Email address:xhou@usf....

    work page 2019