Search arXivSearch

arXiv · 2501.03516

The Multiple Equal-Difference Structure of Cyclotomic Cosets

Abstract

In this paper we introduce the definition of equal-difference cyclotomic coset, and prove that in general any cyclotomic coset can be decomposed into a disjoint union of equal-difference subsets. Among the equal-difference decompositions of a cyclotomic coset, an important class consists of those in the form of cyclotomic decompositions, called the multiple equal-difference representations of the coset. There is an equivalent correspondence between the multiple equal-difference representations of $q$-cyclotomic cosets modulo $n$ and the irreducible factorizations of $X^{n}-1$ in binomial form over finite extension fields of $\mathbb{F}_{q}$. We give an explicit characterization of the multiple equal-difference representations of any $q$-cyclotomic coset modulo $n$, through which a criterion for $X^{n}-1$ factoring into irreducible binomials is obtained. In addition, we present an algorithm to simplify the computation of the leaders of cyclotomic cosets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Li Zhu, Juncheng Zhou, Jinle Liu, Hongfeng Wu. 2025-08-28. The Multiple Equal-Difference Structure of Cyclotomic Cosets. https://arxiv.org/abs/2501.03516

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