arXiv · 2607.17267
Consecutive non-square non-primitive tuples in finite fields
Abstract
Let $q$ be an odd prime power and put \[ \theta_q=\frac{\varphi(q-1)}{q-1}. \] An element of $\Fq$ is called non-square non-primitive, or \emph{NSNP}, if it is both a non-square and a non-primitive element. Let $\ell$ be an odd prime divisor of $q-1$. We obtain a character-sum estimate for the number of translates of an arbitrary finite set lying in the set of non-square $\ell$th powers. Combining this estimate with a finite computation, we prove that $\theta_q<4/15$ guarantees three consecutive NSNP elements. On the boundary $\theta_q=4/15$, the only exceptions are $q\in\{31,61,121\}$. As a further application, we show that for $\operatorname{char}\Fq>3$, the inequality $\theta_q<8/35$ guarantees four consecutive NSNP elements, with $q=211$ as the unique exception on the boundary $\theta_q=8/35$. Thus both constants are best possible.
Explore related subjects
Keep this discovery
Juncheng Zhou, Hongfeng Wu. 2026-07-19. Consecutive non-square non-primitive tuples in finite fields. https://arxiv.org/abs/2607.17267
Cite the original work for its findings. Save a collection to share your selection of sources.