Classification conjecture for quadratic permutation systems over finite fields of odd characteristic
Let be an odd prime power and let . A quadratic system is a map
where each has degree at most . Classification conjecture. Such a system induces a permutation of if and only if . Here denotes the equivalence relation introduced in the paper. The conjecture extends the complete classification of bivariate quadratic permutation systems to all dimensions , and the paper presents it as an open problem for quadratic systems in several variables over finite fields of odd characteristic.
References
- Xuan Pang, Yangcheng Li, Pingzhi Yuan and Yuanpeng Zeng, “Determination of Some Types of Permutations over F_q^2 with Low-Degree”, arXiv:2508.01143 (2025).
Progress summary
An unverified posted construction claims the conjecture is false in every dimension three or higher, while the published work only proves the two-dimensional case.
Pang, Li, Yuan, and Zeng (2025) completely classify quadratic permutation systems over in odd characteristic and conjecture that the same identity classification holds for all .
Known results
- Every bivariate quadratic permutation system over of odd characteristic is equivalent to (Pang, Li, Yuan, and Zeng, 2025).
Posted attempt
An undated posted attempt claims a counterexample for every odd prime power and every : with nonsquare . It argues that is bijective on each -fiber, but is nonconstant, unlike the identity’s determinant; the claimed invariant would therefore exclude equivalence to the identity. The complete counterexample claim has not been independently verified.
Current status (as of August 2026): The two-dimensional classification is settled, while a posted but unverified counterexample claim would refute the conjecture for all if its equivalence-invariance argument is correct.
Sources
Solutions 1
This solution needs a summarySee full solution
The conjecture is false for EVERY odd prime power and EVERY , under precisely the polynomial-system equivalences defined in the source.
Let , and choose a nonsquare . Define
For each fixed , the transformation on has matrix
Since is a nonsquare, for every . Thus each -fiber is mapped bijectively to itself, and the remaining coordinates are fixed. Hence permutes .
Its FORMAL Jacobian determinant, however, is
which is a nonconstant polynomial.
Having a nonzero constant formal Jacobian determinant is invariant under both equivalences in Definitions 3.1 and 3.2. Indeed, if
for nonsingular linear transformations , the chain rule gives
An invertible linear substitution preserves whether this polynomial is a nonzero constant.
For a coordinate-shift equivalence, the two systems have the source's exact forms
and
Their Jacobian matrices are block lower triangular with the SAME upper-left block. The lower-right block is respectively the identity or a unit lower-triangular matrix. Therefore
as formal polynomials. Coordinate permutations preserve the same constant-determinant property.
The identity system has Jacobian determinant one, so EVERY polynomial system equivalent to it under the specified operations has nonzero constant Jacobian determinant. Our permutation has nonconstant determinant , and therefore cannot be equivalent to the identity.
Already over the smallest admissible field, take , , and :
For , the fiber determinants are . Hence permutes all 27 points of but is not equivalent to the identity. This refutes the conjecture at its smallest permitted field and dimension.