Search arXivSearch

arXiv · 2412.12455

Explicit Representatives and Sizes of Cyclotomic Cosets II: Cyclotomic Systems and Applications to Constacyclic Codes

Abstract

Let $q=p^e$ be a prime power, let $\ell$ be a prime with $\gcd(\ell,qn)=1$, and let $n$ be a positive integer. While $q$-cyclotomic cosets are usually considered modulo a fixed integer, we consider their behavior along the sequence $n,\ell n,\ell^2n,\ldots$ of moduli. To describe the resulting compatibility among cyclotomic cosets, we introduce the $\ell$-adic $q$-cyclotomic system with base module $n$, defined as the projective limit of the spaces of $q$-cyclotomic cosets modulo $\ell^i n$. We associate to each $q$-cyclotomic coset modulo $n$ a cyclotomic $\ell$-adic integer and use its $\ell$-adic expansion to describe all compatible liftings through the successive levels. This leads to a classification of the corresponding sequences according to their splitting and stable behaviors, together with explicit formulas for the representatives and sizes of their components. We treat separately the cases of odd $\ell$ and $\ell=2$. These results are then used to determine representatives and sizes of $q$-cyclotomic cosets for arbitrary admissible parameters. As an application, we obtain explicit irreducible factorizations of binomials over finite fields and use them to describe the corresponding constacyclic codes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Li Zhu, Hongfeng Wu. 2026-08-24. Explicit Representatives and Sizes of Cyclotomic Cosets II: Cyclotomic Systems and Applications to Constacyclic Codes. https://arxiv.org/abs/2412.12455

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