Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 177 tok/s
Gemini 2.5 Pro 43 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 119 tok/s Pro
Kimi K2 202 tok/s Pro
GPT OSS 120B 439 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

On the construction of small subsets containing special elements in a finite field (1708.05976v2)

Published 20 Aug 2017 in math.NT, cs.CC, and math.CO

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{\delta}\rfloor>1$ and $d\mid qh-1$. Let $r$ be a prime divisor of $q-1$ such that the largest prime power part of $q-1$ has the form $rs$. Then there is a constant $0<\epsilon<1$ such that for a ratio at least $ {q{-\epsilon h}}$ of $\alpha\in \mathbb{F}{q{h}} \backslash\mathbb{F}{q}$, the set $S={ \alpha-xt, x\in\mathbb{F}{q}}$ of cardinality $1+\frac {q-1} {M(h)}$ contains a non-d-th power in $\mathbb{F}{q{\lfloor q\delta\rfloor}}$, where $t$ is the largest power of $r$ such that $t<\sqrt{q}/h$ and $M(h)$ is defined as $$M(h)=\max_{r \mid (q-1)} r{\min{v_r(q-1), \lfloor\log_r{q}/2-\log_r h\rfloor}}.$$ Here $r$ runs thourgh prime divisors and $v_r(x)$ is the $r$-adic oder of $x$. For odd $q$, the choice of $\delta=\frac 12-d, d=o(1)>0$ shows that there exists an explicit subset of cardinality $q{1-d}=O(\log{2+\epsilon'}(qh))$ containing a non-quadratic element in the field $\mathbb{F}{qh}$. On the other hand, the choice of $h=2$ shows that for any odd prime power $q$, there is an explicit subset of cardinality $1+\frac {q-1}{M(2)}$ containing a non-quadratic element in $\mathbb{F}{q2}$. This improves a $q-1$ 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 $\phi(qh-1)$ is very small, where $\phi$ is the Euler's totient function.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.