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.
Some factorization results for bivariate polynomials
Simion Stoilow Institute of Mathematics of the Romanian Academy(罗马尼亚科学院西奥多尔·斯托伊洛数学研究所);Department of Mathematics, Guru Nanak Dev University(古鲁纳纳克德乌大学数学系)
Polynomials in Base $x$ and the Prime-Irreducible Affinity
Arthur Cohn的整系数多项式不可约性准则及其推广将素数与不可约项联系起来,将整基与变量$x$联系起来。当我们沿着这个链接,我们发现,这些多项式是准备泄漏他们的两个秘密:(i)存在一个唯一的“基地- $x$“表示的多项式,使环$\mathbb{Z}[x]$到一个有序域;及(ii)有一个1-正有理素数$p$与在充分大的条件下达到值$p$的不可约多项式$f(x)$的某些无限集合之间的1对应$x$,每个从$p$第分圆多项式在多个步骤中生成。基- $x$表示提供了数值基之间的实用转换方法(更不用说多项式分解算法),而素数不可约对应则为Bouniakowsky猜想提供了一个新的角度,Bouniakowsky猜想是等差数列中关于素数的狄利克雷定理的推广。