On the construction of small subsets containing special elements in a finite field
Abstract: In this note we construct a series of small subsets containing a non-d-th power element in a finite field by applying certain bounds on incomplete character sums. Precisely, let $h=\lfloor q<sup>{\delta}\rfloor>1$ and . Let be a prime divisor of such that the largest prime power part of has the form . Then there is a constant $0<\epsilon<1$ such that for a ratio at least of , the set of cardinality contains a non-d-th power in , where is the largest power of such that $t<\sqrt{q}/h$ and is defined as Here runs thourgh prime divisors and is the -adic oder of . For odd , the choice of $\delta=\frac 12-d, d=o(1)>0$ shows that there exists an explicit subset of cardinality $q<sup>{1-d}=O(\log<sup>{2+\epsilon'}(q<sup>h))$ containing a non-quadratic element in the field . On the other hand, the choice of shows that for any odd prime power , there is an explicit subset of cardinality containing a non-quadratic element in . This improves a construction by Coulter and Kosick \cite{CK} since $\lfloor \log_2{(q-1)}\rfloor\leq M(2) < \sqrt{q}$. In addition, we obtain a similar construction for small sets containing a primitive element. The construction works well provided is very small, where is the Euler's totient function.
Paper Prompts
Sign up for free to create and run prompts on this paper.