Search arXivSearch

arXiv · 2607.09012

The complete cubic Walsh spectrum of a permutation-inverse Boolean family

Abstract

Let $q=2^e$ with $e\ge2$ even, put $d=(q^2+q+1)/3$, and let $σ(X)=X+X^d+X^{dq}$ be the permutation of $\mathbb F_{q^2}$ introduced by Ding, Qu, Wang, Yuan, and Yuan. For $α\in\mathbb F_q^*$, define the Boolean function \[ f_α(x)=\operatorname{Tr}_{q^2}\bigl(α(σ^{-1}(x))^3\bigr), \qquad x\in\mathbb F_{q^2}. \] In this paper, we determine the complete Walsh distribution of $f_α$ in the remaining cubic case $α\in(\mathbb F_q^*)^3$. More precisely, these functions are not bent but are $2$-plateaued: their Walsh values are precisely $0$ and $\pm 2q$, with exact multiplicities. The main new tool is a completion method for the outside Walsh coefficients: the punctured Fourier transform arising from the outside reduction is filled on the missing line, a modification invisible to outside frequencies, and the completed function is then identified with a Boolean component of a Kasami APN monomial. The APN property supplies a fourth-moment identity which, together with the known subfield spectrum and a Hasse divisibility congruence, forces the pointwise cubic spectrum.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kaimin Cheng. 2026-07-10. The complete cubic Walsh spectrum of a permutation-inverse Boolean family. https://arxiv.org/abs/2607.09012

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