Search arXivSearch

arXiv · 1906.08046

Finite field extensions with the line or translate property for $r$-primitive elements

Abstract

Let $r,n>1$ be integers and $q$ be any prime power $q$ such that $r\mid q^n-1$. We say that the extension $\mathbb{F}_{q^n}/\mathbb{F}_q$ possesses the line property for $r$-primitive elements property if, for every $α,θ\in\mathbb{F}_{q^n}^*$, such that $\mathbb{F}_{q^n}=\mathbb{F}_q(θ)$, there exists some $x\in\mathbb{F}_q$, such that $α(θ+x)$ has multiplicative order $(q^n-1)/r$. We prove that, for sufficiently large prime powers $q$, $\mathbb{F}_{q^n}/\mathbb{F}_q$ possesses the line property for $r$-primitive elements. We also discuss the (weaker) translate property for extensions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stephen D. Cohen, Giorgos Kapetanakis. 2019-10-05. Finite field extensions with the line or translate property for $r$-primitive elements. https://arxiv.org/abs/1906.08046

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT