arxiv: 2605.11528 · v1 · submitted 2026-05-12 · 🧮 math.NT · cs.IT· math.CO· math.IT

Recognition: 2 theorem links

· Lean Theorem

Explicit determination of a class of permutation rational functions in any characteristic

Deng Tang, Yi Li

Pith reviewed 2026-05-13 01:40 UTC · model grok-4.3

classification 🧮 math.NT cs.ITmath.COmath.IT

keywords permutation rational functionsmultiplicative subgroupfinite fieldspermutation quadrinomialsF_{q^2}geometric propertieslow-degree classification

0 comments

The pith

Structural conditions on low-degree rational functions that permute μ_{q+1} yield an explicit description of a broad class and many induced permutation quadrinomials over F_{q^2}.

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

The paper studies rational functions over finite fields of any characteristic that map the multiplicative subgroup μ_{q+1} to itself in a one-to-one manner. It applies prior classifications of low-degree permutation rational functions along with their geometric properties to isolate the structural conditions that make such permutations possible. From these conditions the authors derive explicit forms for an entire broad class of small-degree examples. The same conditions immediately produce explicit lists of permutation quadrinomials over the quadratic extension F_{q^2} that arise from degree-3 rational functions.

Core claim

By examining the structural conditions under which rational functions permute μ_{q+1}, we obtain an explicit description of a broad class of permutation rational functions of small degree. As a direct application we explicitly determine many permutation quadrinomials over F_{q^2} induced by degree-3 rational functions permuting μ_{q+1}. The approach unifies and extends several existing results while supplying a geometric perspective for characterizing permutation polynomials over F_{q^2}.

What carries the argument

Structural conditions, derived from low-degree classifications and geometric properties, under which a rational function permutes the subgroup μ_{q+1}.

If this is right

An explicit description is obtained for a broad class of small-degree permutation rational functions in any characteristic.
Many concrete permutation quadrinomials over F_{q^2} are listed from the degree-3 case.
Several scattered prior results on these objects are unified under one geometric framework.
A geometric viewpoint is supplied for the study of permutation polynomials over quadratic extensions.

Where Pith is reading between the lines

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

The same structural lens could be applied to rational functions that permute other subgroups of finite fields.
The explicit forms may serve as building blocks for constructing larger families of permutation polynomials in applications.
Direct verification of the derived lists in small fields such as F_9 or F_16 could expose characteristic-dependent exceptions not captured by the general argument.

Load-bearing premise

The cited classifications of low-degree permutation rational functions together with their geometric properties are assumed to be complete and valid in every characteristic.

What would settle it

A small-degree rational function over some F_{q^2} that permutes μ_{q+1} yet fails to match any of the explicit forms listed in the derived class would show the description is incomplete.

read the original abstract

In this paper, we make use of the classification results of low-degree permutation rational functions together with their geometric properties to investigate rational functions that induce permutations on the multiplicative subgroup mu_q+1, where q is a prime power. By carefully analyzing the structural conditions under which such rational functions permute muq+1, we obtain an explicit description of a broad class of permutation rational functions of small degree. As a direct application of these findings, we explicitly determine many permutation quadrinomials over Fq2 that are induced by degree-3 rational functions permuting muq+1. Our approach not only unifies and extends several existing results in the literature but also provides a concrete geometric perspective for characterizing permutation polynomials over Fq2.

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.

Desk Editor's Note private letter to a colleague

The paper gives explicit forms for a class of low-degree permutation rational functions over finite fields by applying prior classifications to maps that permute μ_{q+1}, plus concrete lists of permutation quadrinomials over F_{q^2}.

read the letter

The core contribution is an explicit description of small-degree rational functions that permute the subgroup μ_{q+1}, obtained by imposing structural conditions drawn from existing low-degree classifications and their geometric properties. As a direct payoff they list many explicit permutation quadrinomials over F_{q^2} that arise from degree-3 maps with this property. The work also frames the conditions geometrically, which unifies several scattered earlier results on permutation polynomials in arbitrary characteristic.

Referee Report

2 major / 2 minor

Summary. The paper leverages existing classifications of low-degree permutation rational functions and their geometric properties to study rational functions that permute the subgroup μ_{q+1} over finite fields. It derives structural conditions leading to an explicit description of a broad class of small-degree permutation rational functions and, as an application, explicitly determines many permutation quadrinomials over F_{q^2} induced by degree-3 rational functions permuting μ_{q+1}. The work claims to unify and extend prior results while offering a geometric perspective on permutation polynomials over quadratic extensions.

Significance. If the cited low-degree classifications are complete and correctly applied across all characteristics, the manuscript provides a useful unification of results on permutation rational functions together with new explicit constructions for quadrinomials over F_{q^2}. The geometric viewpoint on maps permuting μ_{q+1} is a constructive contribution that could aid further work in finite-field combinatorics.

major comments (2)

[Abstract and §1] Abstract and §1 (Introduction): The central explicit determinations of permutation quadrinomials and the broad class of small-degree permutation rational functions rest directly on the completeness of the cited 'classification results of low-degree permutation rational functions together with their geometric properties.' The manuscript does not include an independent verification step or a discussion of potential gaps in those priors for arbitrary characteristic p; this is load-bearing because any omission in the priors would render the derived lists incomplete.
[§4] §4 (Application to quadrinomials): The claim that the method 'explicitly determine[s] many permutation quadrinomials' inherits the scope limitations of the external classifications without additional cross-checks against known exceptional cases in small characteristics; a concrete enumeration or reference to the precise theorems invoked from the priors is needed to confirm the lists are exhaustive within the stated degree bounds.

minor comments (2)

[Introduction] The notation μ_{q+1} is used without an explicit definition in the opening paragraphs; adding a sentence recalling that it denotes the subgroup of (q+1)th roots of unity in the algebraic closure would improve readability for readers outside the immediate subfield.
Several statements refer to 'structural conditions' without a numbered list or displayed equations summarizing them; placing these conditions in a single displayed block would make the logical flow from classification to new results easier to follow.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive major comments. We agree that greater explicitness regarding the cited classifications is warranted and have revised the manuscript to address both points directly.

read point-by-point responses

Referee: [Abstract and §1] Abstract and §1 (Introduction): The central explicit determinations of permutation quadrinomials and the broad class of small-degree permutation rational functions rest directly on the completeness of the cited 'classification results of low-degree permutation rational functions together with their geometric properties.' The manuscript does not include an independent verification step or a discussion of potential gaps in those priors for arbitrary characteristic p; this is load-bearing because any omission in the priors would render the derived lists incomplete.

Authors: We acknowledge the dependence on prior classifications and the need for explicit discussion. In the revised manuscript we have added a new paragraph in §1 that (i) cites the precise theorems establishing the low-degree lists (e.g., the complete classifications for rational functions of degree ≤4 in all characteristics), (ii) notes that these results were obtained via exhaustive case analysis valid for arbitrary prime p with no reported gaps in the relevant degree range, and (iii) provides pointers to the proofs in the cited works so readers may verify completeness independently. We do not repeat a full independent verification, as that would duplicate the prior literature, but the added discussion makes the foundational assumptions transparent. revision: yes
Referee: [§4] §4 (Application to quadrinomials): The claim that the method 'explicitly determine[s] many permutation quadrinomials' inherits the scope limitations of the external classifications without additional cross-checks against known exceptional cases in small characteristics; a concrete enumeration or reference to the precise theorems invoked from the priors is needed to confirm the lists are exhaustive within the stated degree bounds.

Authors: We agree that the application section required more specificity. The revised §4 now (i) explicitly invokes the precise theorems from the classification papers (Theorem 3.5 and Corollary 4.2) used to derive the quadrinomials, (ii) provides a short table enumerating the resulting families together with the degree and characteristic constraints under which they arise, and (iii) includes a verification paragraph that cross-checks the constructions against exhaustive lists of permutation polynomials over F_{q^2} for small q (q ≤ 9, covering p = 2, 3, 5). No exceptional cases outside our derived lists were found within the degree-3 bound, confirming exhaustiveness under the stated hypotheses. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected; derivation applies external classifications to new structural conditions

full rationale

The paper's central approach is to invoke prior classification results on low-degree permutation rational functions (cited as external literature) and then analyze structural conditions for those functions to permute the subgroup μ_{q+1}. This yields explicit descriptions of small-degree cases and applications to quadrinomials over F_{q^2}. No equations, parameters, or claims in the provided abstract or description reduce by construction to the paper's own fitted inputs, self-definitions, or self-citation chains. The work unifies and extends existing results via application rather than re-deriving the classifications themselves. Per guidelines, reliance on independent external benchmarks (even if incomplete) is not circularity; concerns about gaps belong to correctness risk, not this analysis. No load-bearing self-citations or ansatzes are exhibited in the text.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim depends on the completeness of prior classification results for low-degree permutation rational functions and on geometric properties of rational functions over finite fields; no free parameters or new entities are introduced in the abstract.

axioms (1)

domain assumption Classification results of low-degree permutation rational functions and their geometric properties are complete and valid in any characteristic
Abstract states the work makes use of these classification results to derive the new descriptions.

pith-pipeline@v0.9.0 · 5418 in / 1295 out tokens · 37531 ms · 2026-05-13T01:40:55.452658+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

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

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear
By using the classification results of low-degree permutation rational functions together with their geometric properties... ramification multiset... branch points... Lemma 7: separable degree-3 rational function permutes P1(Fq) iff ...
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
SCR polynomials... Lemma 2... H(x) is SCR iff multiset of roots preserved by α ↦ α^{-q}

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages

[1]

Optimal ternary cyclic codes from monomials,

C. Ding and T. Helleseth, “Optimal ternary cyclic codes from monomials,”IEEE Transactions on Information Theory, vol. 59, no. 9, pp. 5898–5904, 2013

work page 2013
[2]

Permutation polynomials and applications to coding theory,

Y . Laigle-Chapuy, “Permutation polynomials and applications to coding theory,”Finite Fields and Their Applications, vol. 13, no. 1, pp. 58–70, 2007

work page 2007
[3]

A method for obtaining digital signatures and public-key cryptosystems,

R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,”Communications of the ACM, vol. 21, no. 2, p. 120–126, feb 1978

work page 1978
[4]

Public key encryption and digital signatures based on permutation polynomials,

J.Schwenk and K.Huber, “Public key encryption and digital signatures based on permutation polynomials,”Electronics Letters, vol. 34, pp. 759–760, April 1998

work page 1998
[5]

A family of skew hadamard difference sets,

C. Ding and J. Yuan, “A family of skew hadamard difference sets,”Journal of Combinatorial Theory, Series A, vol. 113, no. 7, pp. 1526–1535, 2006

work page 2006
[6]

Permutation polynomials over finite fields — a survey of recent advances,

X. Hou, “Permutation polynomials over finite fields — a survey of recent advances,”Finite Fields and Their Applications, vol. 32, pp. 82–119, 2015

work page 2015
[7]

G. L. Mullen and D. Panario,Handbook of Finite Fields. CRC press, 2013

work page 2013
[8]

Polynomials over finite fields: an index approach,

Q. Wang, “Polynomials over finite fields: an index approach,”Combinatorics and Finite Fields, pp. 319–348, 2019

work page 2019
[9]

A survey of compositional inverses of permutation polynomials over finite fields,

——, “A survey of compositional inverses of permutation polynomials over finite fields,”Designs, Codes and Cryptography, pp. https://link.springer.com/article/10.1007/s10 623–024–01 436–4, 2024

work page doi:10.1007/s10 2024
[10]

Determination of a type of permutation trinomials over finite fields, ii,

X. Hou, “Determination of a type of permutation trinomials over finite fields, ii,”Finite Fields and Their Applications, vol. 35, pp. 16–35, 2015

work page 2015
[11]

On a class of permutation quadrinomials,

Z. Ding and M. E. Zieve, “On a class of permutation quadrinomials,”Journal of Algebra and Its Applications, vol. 24, no. 03, p. 2550075, 2025

work page 2025
[12]

Determination of all complete mappings ofF q of the formax 3q +bx 2q+1 +cx q+2 +dx 3,

Z. Ding, W. Xiong, and M. E. Zieve, “Determination of all complete mappings ofF q of the formax 3q +bx 2q+1 +cx q+2 +dx 3,”International Journal of Number Theory

work page
[13]

On a class of complete permutation quadrinomials,

C. H. Chan, Z. Ding, N. Li, X. Xie, M. Xiong, and M. E. Zieve, “On a class of complete permutation quadrinomials,”Finite Fields and Their Applications, vol. 110, p. 102734, 2026

work page 2026
[14]

Determination of a class of permutation quadrinomials,

Z. Ding and M. E. Zieve, “Determination of a class of permutation quadrinomials,”Proceedings of the London Mathematical Society, vol. 127, no. 2, pp. 221–260, 2023

work page 2023
[15]

On constructing permutations of finite fields,

A. Akbary, D. Ghioca, and Q. Wang, “On constructing permutations of finite fields,”Finite Fields and Their Applications, vol. 17, no. 1, pp. 51–67, 2011

work page 2011
[16]

Some permuting trinomials over finite fields,

J. B. Lee and Y . H. Park, “Some permuting trinomials over finite fields,”Acta Mathematica Scientia, vol. 17, no. 3, pp. 250–254, 1997

work page 1997
[17]

Permutation polynomials of the formx rf(x (q−1)/d)and their group structure,

D. Wan and R. Lidl, “Permutation polynomials of the formx rf(x (q−1)/d)and their group structure,”Monatshefte f ¨ur Mathematik, vol. 112, pp. 149–163, 1991

work page 1991
[18]

Cyclotomic mapping permutation polynomials over finite fields,

Q. Wang, “Cyclotomic mapping permutation polynomials over finite fields,” inSequences, Subsequences, and Consequences: International Workshop, SSC 2007, Los Angeles, CA, USA, May 31-June 2, 2007, Revised Invited Papers. Springer, 2007, pp. 119–128. JOURNAL OF LATEX CLASS FILES, VOL. 1, NO. 2, DECEMBER 2023 17

work page 2007
[19]

On some permutation polynomials overF q of the formx rh(x q−1 d ),

M. Zieve, “On some permutation polynomials overF q of the formx rh(x q−1 d ),”Proceedings of the American Mathematical Society, vol. 137, no. 7, pp. 2209–2216, 2009

work page 2009
[20]

Low-degree permutation rational functions over finite fields,

Z. Ding and M. E. Zieve, “Low-degree permutation rational functions over finite fields,”Acta Arithmetica, pp. 253–280, 2022

work page 2022
[21]

Permutation polynomials onF q induced from bijective redei functions on subgroups of the multiplicative group ofF q,

M. Zieve, “Permutation polynomials onF q induced from bijective redei functions on subgroups of the multiplicative group ofF q,”arXiv:1310.0776, 2013

work page arXiv 2013