A complete classification of minimal value set polynomials
math.NT
Submitted: 2026-10-27
Updated: 2026-10-27
Comments: 24 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: We give a complete classification of minimal value set polynomials (MVSPs), settling a problem introduced by Carlitz, Lewis, Mills and Straus in 1961.
Abstract
We give a complete classification of minimal value set polynomials (MVSPs), settling a problem introduced by Carlitz, Lewis, Mills and Straus in 1961. For MVSPs F in F q[x] with more than two values, earlier work showed that their value sets F(a): a in F q can be reduced to the form U v=u v:u in U, where U is a vector space over a subfield of F q, and v at least 1 is a suitable integer. This classification proceeds through two parallel constructions, according to whether U is itself a field or not, governed respectively by the cyclic multiplicative structure and by the additive linearized structure. In both cases, Hasse derivatives impose constraints on the root multiplicities of a distinguished factor of F, leading to a factorization that preserves the underlying structure in a polynomial of smaller degree and thus allows the argument to be iterated.
Related papers
- K ab has the Bogomolov property for canonical heights
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
- Wasserstein rates of all orders for the Sato-Tate law of Kloosterman sums
- Riemann functions for almost primes and their counting errors
- Topological flatness of orthogonal spin local models
- Asymptotic counting of integers with prime factors p r a s b