arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.14613math.NTmath.CO
收藏

复合乘积的因式分解与不可约性

Factorization and irreducibility of composed products

Lukas Kölsch, Lucas Krompholz, Gohar M. Kyureghyan

AI总结:

本文完整刻画了不可约多项式复合乘积的不可约性条件,证明其等价于次数互素且 diamond 乘积满足共轭消去,并给出判定共轭消去的精确判据与高效算法,同时探讨了正规元构造。

摘要:

Brawley 和 Carlitz 于 1987 年引入了有限域元素的 diamond 乘积以及相应的多项式复合乘积。复合乘积提供了一种从低次不可约多项式构造大合数次数不可约多项式的方法。我们证明,两个次数分别为 $m$ 和 $n$ 的不可约多项式的复合乘积再次不可约,当且仅当 $m$ 和 $n$ 互素且所涉及的 diamond 乘积满足一种特殊的消去性质,即所谓的共轭消去(conjugate cancellation)。这完成了对不可约复合乘积的刻画,此前多篇论文曾对此进行过研究。更一般地,我们给出了 diamond 乘积何时满足共轭消去的精确判据。对于由二元多项式定义的 diamond 乘积,我们证明了刻画共轭消去何时成立的简单判据。我们还提供了检验这些判据的高效算法。在多项式为双线性的情形下,我们得到了更强的结果以及更高效的算法。最后,我们考虑了利用复合乘积及我们所发展的方法构造正规元的可能途径。

英文摘要:

Brawley and Carlitz introduced diamond products of elements of finite fields and associated composed products of polynomials in 1987. Composed products yield a method to construct irreducible polynomials of large composite degrees from irreducible polynomials of lower degrees. We show that the composed product of two irreducible polynomials of degrees $m$ and $n$ is again irreducible if and only if $m$ and $n$ are coprime and the involved diamond product satisfies a special cancellation property, the so-called conjugate cancellation. This completes the characterization of irreducible composed products, considered in several previous papers. More generally, we give precise criteria when a diamond product satisfies conjugate cancellation. For diamond products defined via bivariate polynomials, we prove simple criteria that characterize when conjugate cancellation holds. We also provide efficient algorithms to check these criteria. We achieve stronger results as well as more efficient algorithms in the case that the polynomials are bilinear. Lastly, we consider possible constructions of normal elements using composed products and the methods we developed.

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

↑