On a conjecture of polynomials with prescribed range (Q439077)

Let \(\mathbb F_q\) be a finite field of \(q=p^n\) elements, with \(q>9\). The authors show that for each \(m\), \(3 < m\leq \min\{ p-1, q/2\}\), there exists a multiset \(M\) with \(\sum_{b\in M} b=0\) and highest multiplicity \(q-m\) achieved at \(0\in M\) such that any polynomial over \(\mathbb F_q\) with range \(M\) has degree larger than \(q-m\). This shows that a conjecture of \textit{A. Gács, T. Héger, Z. L. Nagy} and \textit{D. Pálvölgyi} [Finite Fields Appl. 16, No. 5, 301--314 (2010; Zbl 1245.11116)] fails.