Search arXivSearch

arXiv · 2502.04545

Two Absolutely Irreducible Polynomials over $\Bbb F_2$ and Their Applications to a Conjecture by Carlet

Abstract

Two polynomials $F_k(X_1,\dots,X_k)$ and $Θ_k(X_1,\dots,X_k)$ over $\Bbb F_2$ arose from the study of a conjecture by C. Carlet about the sum-freedom of the multiplicative inverse function of $\Bbb F_{2^n}$. Both $F_k$ and $Θ_k$ are homogeneous and symmetric with $\text{deg}\,F_k=2^k-2$ and $\text{deg}\,Θ_k=2^{k-1}$. It is known that $F_k$ is absolutely irreducible for $k\ge 3$. Using the Lang-Weil bound and a curious connection between $F_k$ and $Θ_k$, we show that $Θ_k$ ($k\ge 3$) is also absolutely irreducible. This conclusion allows us to improve several existing results about Carlet's conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiang-dong Hou, Shujun Zhao. 2025-02-06. Two Absolutely Irreducible Polynomials over $\Bbb F_2$ and Their Applications to a Conjecture by Carlet. https://arxiv.org/abs/2502.04545

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