Search arXivSearch

arXiv · 1906.07240

On the Tu-Zeng Permutation Trinomial of Type $(1/4,3/4)$

Abstract

Let $q$ be a power of $2$. Recently, Tu and Zeng considered trinomials of the form $f(X)=X+aX^{(1/4)q^2(q-1)}+bX^{(3/4)q^2(q-1)}$, where $a,b\in\Bbb F_{q^2}^*$. They proved that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if $b=a^{2-q}$ and $X^3+X+a^{-1-q}$ has no root in $\Bbb F_q$. In this paper, we show that the above sufficient condition is also necessary.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiang-dong Hou. 2019-06-17. On the Tu-Zeng Permutation Trinomial of Type $(1/4,3/4)$. https://arxiv.org/abs/1906.07240

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