Dickson polynomial discriminators
The authors study the Dickson discriminator problem, that is the problem of determining the least \(k\in \mathbb{N}\) such that the Dickson polynomial has distinct output values for a predetermined \(n\in \mathbb{N}\) consecutive input values. The authors make a connection between this problem and permutation polynomials over the ring of integers modulo \(k\), a relationship ostensibly missed by other authors. They conclude the paper with some open problems ``designed to stimulate further work on Dickson discriminators''.
permutation polynomials over finite rings
scientific article; zbMATH DE number 913832