<p>Let <i>n</i> be any positive integer and <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {F}_q\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation> be a finite field with <i>q</i> elements, where <i>q</i> is a prime power. In this paper, we give the irreducible factorization of the <i>n</i>-th cyclotomic polynomial <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Phi _n(x)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="normal">Φ</mi> <mi>n</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> over <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {F}_q\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation>, which can be achieved by utilizing the irreducible factorization of lower-order cyclotomic polynomial <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Phi _m(x)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="normal">Φ</mi> <mi>m</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> over <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {F}_q\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation> when <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="100" /> </InlineMediaObject> <EquationSource Format="TEX">\(\text {rad}(n)|(q+1)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>rad</mtext> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mo stretchy="false">|</mo> <mo stretchy="false">(</mo> <mi>q</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq7.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="159" /> </InlineMediaObject> <EquationSource Format="TEX">\(m=\gcd (n,q+1)&gt;1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>=</mo> <mo movablelimits="true">gcd</mo> <mo stretchy="false">(</mo> <mi>n</mi> <mo>,</mo> <mi>q</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo>&gt;</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. By doing so, we provide a unified explanation of the irreducible factorization of <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Phi _n(x)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="normal">Φ</mi> <mi>n</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> over <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {F}_q\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation> and elucidate the mathematical mechanism for computing the coefficients of these irreducible factors. When <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq10.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\(4\not \mid n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>4</mn> <mo>∤</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation>, there is a one-to-one correspondence between the irreducible factors of <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Phi _m(x)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="normal">Φ</mi> <mi>m</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Phi _n(x)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="normal">Φ</mi> <mi>n</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> over <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1404_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {F}_q\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation>. In addition, some numerical examples are presented to illustrate this concept.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Computing factors of cyclotomic polynomials over finite fields

  • Deepak Sehrawat,
  • Manjit Singh

摘要

Let n be any positive integer and \(\mathbb {F}_q\) F q be a finite field with q elements, where q is a prime power. In this paper, we give the irreducible factorization of the n-th cyclotomic polynomial \(\Phi _n(x)\) Φ n ( x ) over \(\mathbb {F}_q\) F q , which can be achieved by utilizing the irreducible factorization of lower-order cyclotomic polynomial \(\Phi _m(x)\) Φ m ( x ) over \(\mathbb {F}_q\) F q when \(\text {rad}(n)|(q+1)\) rad ( n ) | ( q + 1 ) and \(m=\gcd (n,q+1)>1\) m = gcd ( n , q + 1 ) > 1 . By doing so, we provide a unified explanation of the irreducible factorization of \(\Phi _n(x)\) Φ n ( x ) over \(\mathbb {F}_q\) F q and elucidate the mathematical mechanism for computing the coefficients of these irreducible factors. When \(4\not \mid n\) 4 n , there is a one-to-one correspondence between the irreducible factors of \(\Phi _m(x)\) Φ m ( x ) and \(\Phi _n(x)\) Φ n ( x ) over \(\mathbb {F}_q\) F q . In addition, some numerical examples are presented to illustrate this concept.