arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.03516math.NTcs.ITmath.IT
收藏

分圆陪集的多元等差结构

The Multiple Equal-Difference Structure of Cyclotomic Cosets

Li Zhu, Juncheng Zhou, Jinle Liu, Hongfeng Wu

AI总结:

本文通过引入等差分圆陪集及其多元等差表示,建立其与 X^n−1 二项式不可约分解的对应关系,并给出判别准则和简化首元计算的算法。

摘要:

本文引入等差分圆陪集的定义,并证明一般情况下任一分圆陪集均可分解为若干等差子集的不交并。在分圆陪集的等差分解中,一类重要的分解具有分圆分解的形式,称为该陪集的多元等差表示。模 n 的 q-分圆陪集的多元等差表示与 X^n−1 在 F_q 的有限扩域上二项式形式的不可约分解之间存在等价对应关系。我们给出任意模 n 的 q-分圆陪集的多元等差表示的显式刻画,并由此得到 X^n−1 可分解为不可约二项式乘积的判别准则。此外,我们提出一种简化分圆陪集首元计算的算法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑