Carlitz–Lewis–Mills–Straus minimal value set polynomial problem
For every finite field , classify all nonconstant polynomials of degree whose value set has the minimum possible cardinality, namely . Such polynomials are called minimal value set polynomials.
References
- A complete classification of minimal value set polynomials — arXiv — Herivelto Borges, Lucas Reis
Source: arXiv
Progress summary
A 2025 preprint proves substantial special cases and structural results, but its proposed classification in every finite field remains a conjecture.
The problem asks for a classification of polynomials over finite fields whose value sets are as small as possible. It originated with Carlitz, Lewis, Mills, and Straus in the early 1960s; the general classification remains open.
Known results
- Complete classifications were previously known for field sizes and .
- Further cases were known for .
- For value sets with more than two elements, Theorem 2.2 characterizes the possible sets as , with an -subspace containing and .
- The affine-subspace case and the classification over are treated completely.
August 9, 2025 preprint
Herivelto Borges and Lucas Reis prove these structural and finite-field cases in “Minimal Value Set Polynomials.” Their all-field classification of the polynomials themselves is stated as Conjecture 1.1, so the preprint does not close the original problem. No independent assessment, correction, withdrawal, or retraction was found.
Current status (as of October 2026): substantial structural, large-value-set, and small-field cases are established, but the all-field classification remains open and the 2025 preprint's broader claim is unverified.
Solutions 0
No solutions have been posted yet.