Finite field permutation polynomial research sounds abstract at first, but the central question is beautifully simple:

When does a polynomial rearrange every element of a finite field without repeating anything and without missing anything?

That is the question behind Brian M. Woody’s sole-author research paper, A Complete Classification of a Reciprocal Degree-Five Quadrinomial Family over \(\mathbb{F}_{q^2}\).

The paper studies a sparse four-term polynomial over the quadratic finite field extension \(\mathbb{F}_{q^2}\). It proves exactly when that polynomial becomes a permutation polynomial. In other words, it gives a complete classification theorem, not just a collection of examples.

For students, this is a window into how real mathematical research works. A concrete-looking polynomial leads to finite fields, roots of unity, rational maps, quadratic characters, trace conditions, conics, Weil bounds, computational verification, and proof-based classification.

Start with the hosted paper PDF on BrianWoody.com:
Download the finite field permutation polynomial paper.

This overview explains the main theorem, the polynomial family, the proof strategy, the verification files, and why this work connects naturally to finite field theory and Galois fields, Abstract Algebra, field extensions, Galois Theory, quotient groups, the Galois group of \(x^3-2\), Real Analysis, Linear Algebra, and advanced university mathematics.

Estimated read time: 12–16 minutes.

Quick Summary

Brian M. Woody’s paper classifies when a reciprocal degree-five quadrinomial family over \(\mathbb{F}_{q^2}\) is a permutation polynomial. The main idea is to turn a full finite-field problem into a more structured problem on the finite-field unit circle.

  • Paper: A Complete Classification of a Reciprocal Degree-Five Quadrinomial Family over \(\mathbb{F}_{q^2}\).
  • Author: Brian M. Woody.
  • Main object: a reciprocal degree-five quadrinomial over \(\mathbb{F}_{q^2}\).
  • Main question: when does the polynomial permute the entire finite field?
  • Main result: a complete classification of all nondegenerate cases in the family.
  • Key tools: root-of-unity reduction, unit-circle rational maps, quadratic characters, trace conditions, conics, Weil bounds, and finite verification.
  • Research hub: Brian M. Woody Research.
  • Student download: PDF hosted on BrianWoody.com.

Finite Field Permutation Polynomial Key Facts

  • The polynomial family has four terms, so it is a quadrinomial.
  • The coefficients lie in \(\mathbb{F}_q\), but the polynomial acts on \(\mathbb{F}_{q^2}\).
  • The family is reciprocal, which creates useful algebraic symmetry.
  • The proof reduces the full-field problem to a rational map on the unit circle \(\mu_{q+1}\).
  • The classification separates unit-circle bijectivity from the full-field condition \(\gcd(5,q-1)=1\).
  • The infinite branch occurs for \(q\equiv1\pmod4\), subject to explicit quadratic-character conditions.
  • The sporadic full-field cases occur for \(q=7\), \(q=19\), and \(q=23\).
  • The verification files check the remaining bounded finite cases directly.
  • The paper connects finite fields, field extensions, roots of unity, Galois Theory, conics, and computational proof.

Why This Paper Matters

Permutation polynomials are deceptively simple objects. You write down a polynomial, plug in every element of a finite field, and ask whether the outputs are all different.

But over finite fields, that simple question becomes deep very quickly. The answer can depend on the field size, congruence classes, roots of unity, character sums, algebraic curves, exact finite verification, and the structure of a field extension such as \(\mathbb{F}_{q^2}/\mathbb{F}_q\).

This paper matters because it gives a complete classification for a specific reciprocal degree-five quadrinomial family. Complete classifications are valuable because they do more than produce examples. They tell us exactly when a family works and exactly when it fails.

For students, this is a powerful lesson: advanced mathematics often begins with a single object and then asks the right structural question.

Students who want the broader context can also explore the Brian M. Woody Research Hub and the companion guide Dickson Trace Curves and Reciprocal Quadrinomials over Finite Fields.

What the Paper Proves

The paper proves a complete classification theorem for a nondegenerate reciprocal degree-five quadrinomial family over \(\mathbb{F}_{q^2}\).

The central question is:

Exactly when does this four-term polynomial permute every element of \(\mathbb{F}_{q^2}\)?

The answer has two major parts. One part gives infinite families when \(q\equiv1\pmod4\). The other part handles the \(q\equiv3\pmod4\) branch, where the paper proves that only a small number of sporadic full-field cases survive.

The important point is that the paper is not just finding a few interesting values of \(q\). It is classifying all nondegenerate cases in the family.

Paper Details

Title A Complete Classification of a Reciprocal Degree-Five Quadrinomial Family over \(\mathbb{F}_{q^2}\)
Author Brian M. Woody
Research Area Finite field theory, permutation polynomials, reciprocal quadrinomials, sparse polynomial maps, Abstract Algebra, Galois fields, and Number Theory
arXiv ID arXiv:2607.01267
DOI 10.48550/arXiv.2607.01267
arXiv Category General Mathematics — math.GM
MSC Classes 11T06, 11T55, 12E20
Date June 29, 2026

The official scholarly record is linked later in the citation section. The primary reader download is the hosted PDF on BrianWoody.com:
Download the paper PDF.

Finite Field Permutation Polynomials

A permutation polynomial over a finite field is a polynomial that maps the elements of a finite field bijectively onto themselves. In plain language, it rearranges the field elements without repeating or missing any value.

For a finite field \(\mathbb{F}_q\), a polynomial \(f(x)\in\mathbb{F}_q[x]\) is a permutation polynomial if the map

\[
x\longmapsto f(x)
\]

is a bijection from \(\mathbb{F}_q\) to \(\mathbb{F}_q\).

Permutation polynomials are important in finite field theory, Abstract Algebra, combinatorics, finite geometry, coding theory, cryptography, and computational algebra. They are also excellent examples of how a simple algebraic question can lead to deep mathematical structure.

Why finite fields matter

Finite fields, also called Galois fields, are algebraic systems with finitely many elements where addition, subtraction, multiplication, and division by nonzero elements all work cleanly.

Students learning these ideas often begin with Abstract Algebra, then build toward finite fields, Galois Theory, field extensions, quotient groups, number theory, and research-level polynomial classification problems.

A classical Galois Theory example that helps students understand roots, field extensions, and automorphisms is Why Does \(x^3-2\) Create \(S_3\)? Galois Theory Explained.

The Reciprocal Degree-Five Quadrinomial Family

The paper studies the family

\[
F_{a,b}(x)
=
x^5+a x^{q+4}+b x^{4q+1}+\frac{a}{b}x^{5q},
\qquad a,b\in\mathbb{F}_q,
\]

over the quadratic finite field extension \(\mathbb{F}_{q^2}\), where \(q\) is an odd prime power.

This is a quadrinomial because it has four terms. It is sparse because very few monomials appear. It is reciprocal because the exponents and coefficient relation create a symmetric structure after reducing the problem to the finite-field unit circle.

The nondegenerate cases require:

\[
b\neq0,
\qquad
b\neq\pm1,
\qquad
a\neq\pm b.
\]

These restrictions remove degenerate cases and isolate the genuinely reciprocal degree-five quadrinomial behavior.

Why the unit circle appears

The proof uses a root-of-unity reduction. Instead of attacking the full-field permutation problem directly on \(\mathbb{F}_{q^2}\), the problem is reduced to a permutation problem on the subgroup:

\[
\mu_{q+1}
=
\{x\in\mathbb{F}_{q^2}:x^{q+1}=1\}.
\]

This subgroup is often called the finite-field unit circle. The reciprocal structure of the quadrinomial family produces a rational map on \(\mu_{q+1}\), and understanding that rational map becomes the core of the classification.

Main Theorem Summary

Let \(q\) be an odd prime power and let \(a,b\in\mathbb{F}_q\) satisfy the nondegeneracy conditions:

\[
b\neq0,
\qquad
b\neq\pm1,
\qquad
a\neq\pm b.
\]

The paper proves that \(F_{a,b}(x)\) is a permutation polynomial of \(\mathbb{F}_{q^2}\) exactly in the following types of cases:

  • Infinite branch: \(q\equiv1\pmod4\), \(q\not\equiv1\pmod5\), and \(b\) satisfies one of two explicit quadratic-character conditions.
  • Sporadic branch: a finite list of exceptional full-field cases remains for \(q=7\), \(q=19\), and \(q=23\).

The classification separates the unit-circle bijectivity problem from the full-field condition:

\[
\gcd(5,q-1)=1.
\]

That separation is essential. A map can behave correctly on the unit circle but still fail the full-field permutation condition. The paper handles both requirements.

The two branches of the classification

The classification has two sharply different branches:

  • When \(q\equiv1\pmod4\), infinite families occur and are controlled by quadratic-character conditions.
  • When \(q\equiv3\pmod4\), a square-class obstruction converts the problem into a character-sum problem on a conic.

A Weil-bound argument eliminates all large fields in the \(q\equiv3\pmod4\) branch, and finite verification leaves only the sporadic fields \(q=7,19,23\).

Proof Strategy

The proof begins with root-of-unity reduction for polynomials over \(\mathbb{F}_{q^2}\). This reduces the full-field permutation question to two pieces:

  1. a coprimality condition, and
  2. a permutation problem on the unit circle \(\mu_{q+1}\).

The reciprocal structure of the quadrinomial family creates a constrained rational function on \(\mu_{q+1}\). After analyzing possible collisions on that unit circle, the problem reduces to trace conditions over \(\mathbb{F}_q\).

High-Level Proof Roadmap

  1. Start with the polynomial family: \(F_{a,b}(x)=x^5+a x^{q+4}+b x^{4q+1}+\frac{a}{b}x^{5q}\).
  2. Apply root-of-unity reduction: move from \(\mathbb{F}_{q^2}\) to \(\mu_{q+1}\).
  3. Analyze the induced rational map: use the reciprocal structure to control possible collisions.
  4. Translate collisions into trace conditions: reduce the problem to algebra over \(\mathbb{F}_q\).
  5. Split into congruence classes: \(q\equiv1\pmod4\) behaves differently from \(q\equiv3\pmod4\).
  6. Use quadratic-character conditions: describe the infinite branch.
  7. Use square-class obstructions, character sums, conics, and Weil bounds: restrict the sporadic branch.
  8. Use finite verification: check the remaining bounded cases.

This is the kind of structure students eventually learn to recognize in advanced mathematics: simplify the domain, exploit symmetry, translate the problem, split into cases, prove the general theorem, and verify the finite edge cases.

What Collision Means in This Paper

A collision means that two distinct inputs produce the same output under the induced map. In the finite-field unit-circle reduction, this means two distinct elements of \(\mu_{q+1}\) map to the same value.

A permutation polynomial cannot have collisions. If two different inputs give the same output, then the map is not one-to-one, and therefore it cannot be a permutation.

This is why collision analysis is central to the proof. The paper studies when collisions are forced, when they can be avoided, and how the absence of collisions interacts with quadratic characters, trace conditions, conics, and finite verification.

This same idea appears in many parts of mathematics: to prove a function is bijective, one must control whether distinct inputs can collapse to the same output. In group theory, this kind of collapse is also related to kernels and quotient groups, which are explained in Quotient Groups Explained: Cosets, Normal Subgroups, and the First Isomorphism Theorem.

Verification Files

The proof uses finite verification in bounded ranges. The verification package checks the remaining finite cases exhaustively and separates unit-circle bijectivity from the full-field condition \(\gcd(5,q-1)=1\).

  • All odd prime powers \(q\le289\) with \(q\equiv1\pmod4\).
  • All odd prime powers \(q\le500\) with \(q\equiv3\pmod4\).
  • Unit-circle bijectivity is checked separately from the full-field condition \(\gcd(5,q-1)=1\).
  • The sporadic full-field survivors are checked directly.

The verification package contains:

  • verify_quadrinomial_family.py — Python verification script.
  • verification_output.txt — output from running the script.
  • README.md — explanation of the verification files.

Download the verification files from BrianWoody.com

Academic Record and Citation

For students, the best reading copy is the PDF hosted on BrianWoody.com:
Download the paper PDF.

For scholarly verification, the official arXiv record is available here:
arXiv:2607.01267.

DOI: 10.48550/arXiv.2607.01267.

Suggested Citation

Brian M. Woody, A Complete Classification of a Reciprocal Degree-Five Quadrinomial Family over \(\mathbb{F}_{q^2}\), arXiv:2607.01267 [math.GM], 2026. DOI: 10.48550/arXiv.2607.01267.

BibTeX

@misc{woody2026degreefivequadrinomial,
author = {Woody, Brian M.},
title = {A Complete Classification of a Reciprocal Degree-Five Quadrinomial Family over {$\mathbb{F}_{q^2}$}},
year = {2026},
eprint = {2607.01267},
archivePrefix = {arXiv},
primaryClass = {math.GM},
doi = {10.48550/arXiv.2607.01267},
url = {https://arxiv.org/abs/2607.01267}
}

Gist.Science External Explanation

The paper is also summarized externally at Gist.Science. This can be useful for discovery because it gives readers another way to locate the paper and see a technical overview.

External AI explanations can be useful for orientation, but the original paper, the hosted PDF on BrianWoody.com, and the Brian M. Woody Research Hub should remain the authoritative sources for technical accuracy.

Connection to Woody Calculus

Woody Calculus is built around a simple idea: students can learn advanced mathematics when ideas are made clear, patterns are made visible, and proof-based reasoning is practiced with structure.

This research page connects that teaching philosophy with original mathematical work. The same habits that support success in Calculus, Differential Equations, Abstract Algebra, Real Analysis, Number Theory, and Topology also appear in research: careful definitions, pattern recognition, computation, abstraction, and proof.

Students who want to build the background for this type of mathematics can explore finite field theory and Galois fields, Abstract Algebra help, field extensions, Galois Theory, the Galois group of \(x^3-2\), and Real Analysis help.

Advanced mathematics is built by seeing structure, writing clean definitions, testing examples, and proving exactly what the pattern allows.

— Brian M. Woody

Abstract Algebra Bridge Lessons

This research paper lives in finite field theory, but the foundations begin in undergraduate Abstract Algebra. Students should understand finite fields, field extensions, roots of unity, quotient groups, Galois groups, and permutation structure before trying to digest every technical detail.

Together, these lessons create a path from coursework to research: start with field extensions, understand how roots move, learn how symmetry groups appear, and then see how finite-field polynomial maps can be classified.

Finite Field Permutation Polynomial FAQ

What is the main result of the paper?

The paper completely classifies when a reciprocal degree-five quadrinomial family over \(\mathbb{F}_{q^2}\) is a permutation polynomial. The classification includes an infinite branch for \(q\equiv1\pmod4\) and sporadic full-field cases for \(q=7\), \(q=19\), and \(q=23\).

What is a permutation polynomial?

A permutation polynomial over a finite field is a polynomial that maps the elements of the field bijectively onto themselves. Every field element appears exactly once as an output.

What is a finite field?

A finite field is an algebraic system with finitely many elements where addition, subtraction, multiplication, and division by nonzero elements are defined. Finite fields are also called Galois fields.

What is a quadrinomial?

A quadrinomial is a polynomial with four terms. The family in this paper has four sparse terms and a coefficient relation that creates a reciprocal structure.

What is a reciprocal quadrinomial?

A reciprocal quadrinomial is a four-term polynomial family whose exponents and coefficients are linked in a way that produces reciprocal behavior after reducing the problem to the finite-field unit circle.

What finite field does the paper study?

The paper studies polynomials over the quadratic finite field extension \(\mathbb{F}_{q^2}\), where \(q\) is an odd prime power.

Why does the unit circle \(\mu_{q+1}\) appear?

The root-of-unity reduction transforms the full-field permutation problem over \(\mathbb{F}_{q^2}\) into a permutation problem on the subgroup \(\mu_{q+1}\), together with a coprimality condition.

What does collision mean in this paper?

A collision means that two distinct inputs give the same output under the induced map. A permutation polynomial cannot have collisions because a permutation must be one-to-one.

What are the sporadic fields in the classification?

The sporadic full-field cases occur for \(q=7\), \(q=19\), and \(q=23\).

Is this a peer-reviewed journal publication?

No. This is an arXiv research preprint. arXiv is a public scholarly archive, not a peer-reviewed journal. Journal publication is a separate process.

Can this paper be cited?

Yes. The paper has a permanent arXiv identifier, arXiv:2607.01267, and DOI 10.48550/arXiv.2607.01267.

Why is this useful for students?

The paper shows how advanced mathematics connects across subjects: finite fields, algebraic structure, polynomial maps, characters, conics, computational verification, and proof. These ideas appear throughout Abstract Algebra, Number Theory, Linear Algebra, Real Analysis, and advanced university mathematics.

Master Advanced Mathematics with Woody Calculus

Understanding research-level mathematics begins with mastering definitions, examples, structure, and proof. Students who want to grow into this type of mathematics need clear setup, precise language, pattern recognition, and the ability to explain why each step is valid.

Woody Calculus provides structured, university-level instruction designed to build real mathematical understanding and exam-ready execution. The goal is not just to recognize formulas. The goal is to know when to use them, how to set them up cleanly, how to interpret each condition, and how to write complete solutions under pressure.

Get Advanced Mathematics Help with Woody Calculus

If you are studying Calculus 2, Calculus 3, Differential Equations, Abstract Algebra, Real Analysis, Number Theory, Topology, finite fields, Galois Theory, or advanced university mathematics, Woody Calculus can help you build a serious system for learning.

Visit BrianWoody.com for Woody Calculus visual mathematics lessons covering free mathematical essays, visual lessons, exam-focused resources, research articles, and advanced university math support.

For structured training, join the Woody Calculus Mastery Lab for university mathematics, where students learn through clean definitions, proof structure, clean setup, formula fluency, pattern recognition, rewriting perfect solutions, and saying each step out loud until the method becomes automatic.

Students can also visit Woody Calculus on Skool to learn more about the Mastery Lab learning community.

Explore more Woody Calculus visual lessons and deep-dive mathematical essays connecting finite field theory, Abstract Algebra, Real Analysis, Calculus 2, Calculus 3, Differential Equations, Number Theory, Topology, proof-based learning, and peak performance study methods.

Students who want to explore the broader research program can use the following links. The research hub connects this classification paper with Dickson trace curves, reciprocal quadrinomials, finite fields, computational verification, and advanced Abstract Algebra.

Private Instruction

Brian M. Woody also works privately with a limited number of serious students who need one-on-one help in Abstract Algebra, Real Analysis, Calculus II, Calculus III, and Differential Equations.

Private instruction is reserved for serious students, requires weekly sessions, requires enrollment in the Woody Calculus Mastery Lab first, and approval is not guaranteed.

Students interested in private instruction can learn more here: Private Math Tutor and Advanced Mathematics Instruction.

About the Author: Brian M. Woody

Brian M. Woody is a professional mathematics educator, research author, Private Professor, and founder of Woody Calculus. His work includes university-level mathematics instruction, finite field theory, Abstract Algebra, Differential Equations, advanced calculus, and mathematical research connected to permutation polynomials and sparse finite-field maps.

Through Woody Calculus, he provides rigorous, exam-focused training in Calculus 2, Calculus 3, Differential Equations, Abstract Algebra, Real Analysis, Number Theory, Topology, and advanced mathematics. His teaching emphasizes clean definitions, proof structure, clean setup, formula fluency, pattern recognition, rewriting perfect solutions, and saying each step out loud until the method becomes automatic.

Related University Math Help Pages

Woody Calculus supports students at major universities with structured help in Calculus 2, Calculus 3, Differential Equations, Abstract Algebra, Real Analysis, Number Theory, Topology, and advanced mathematics. For the full list of supported schools, visit the University Calculus Tutor Hub.

Trusted by Students Nationwide

The Woody Calculus Mastery Lab gives university students access to structured mathematics support, written solutions, video lessons, exam-focused training, proof-based lessons, and expert guidance from Brian M. Woody.

Students use Woody Calculus for Calculus 2, Calculus 3, Differential Equations, Abstract Algebra, Real Analysis, Number Theory, Topology, and other advanced mathematics courses.

How to Use This Woody Calculus Research Page

Students should read this page as a bridge between upper-division mathematics and research-level thinking. The goal is not to memorize every technical detail of the paper immediately. The goal is to see how definitions, examples, reductions, cases, and verification work together in a serious mathematical classification theorem.

  • Start with the object: understand the polynomial family \(F_{a,b}(x)\).
  • Identify the field: the polynomial acts on \(\mathbb{F}_{q^2}\).
  • Understand the goal: determine when the polynomial is a permutation polynomial.
  • Notice the reduction: the problem moves to the unit circle \(\mu_{q+1}\).
  • Track the case split: \(q\equiv1\pmod4\) behaves differently from \(q\equiv3\pmod4\).
  • Connect the proof tools: quadratic characters, trace conditions, conics, Weil bounds, and computation.
  • Study the bigger lesson: advanced mathematics often turns one hard problem into a cleaner equivalent problem.

Where This Topic Appears in University Mathematics

Finite field permutation polynomials appear in Abstract Algebra, Number Theory, finite field theory, Galois fields, coding theory, cryptography, computational algebra, finite geometry, polynomial maps, and proof-based advanced mathematics.