<p>The aim of this paper is to prove that the polynomial <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_787_Article_IEq3.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="562" /> </InlineMediaObject> <EquationSource Format="TEX">\(P(Y)=Y^n+A_{n-1}Y^{n-1}+\cdots +A_{n-k+1}Y^{n-k+1}+A_{n-k}Y^{n-k}+ \cdots + A_1 Y+ A_0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>P</mi> <mrow> <mo stretchy="false">(</mo> <mi>Y</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msup> <mi>Y</mi> <mi>n</mi> </msup> <mo>+</mo> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <msup> <mi>Y</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>-</mo> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <msup> <mi>Y</mi> <mrow> <mi>n</mi> <mo>-</mo> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>+</mo> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>-</mo> <mi>k</mi> </mrow> </msub> <msup> <mi>Y</mi> <mrow> <mi>n</mi> <mo>-</mo> <mi>k</mi> </mrow> </msup> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msub> <mi>A</mi> <mn>1</mn> </msub> <mi>Y</mi> <mo>+</mo> <msub> <mi>A</mi> <mn>0</mn> </msub> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_787_Article_IEq4.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="51" /> </InlineMediaObject> <EquationSource Format="TEX">\(A_0 \ne 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>A</mi> <mn>0</mn> </msub> <mo>≠</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_787_Article_IEq5.gif" Format="GIF" Height="32" Rendition="HTML" Resolution="72" Type="Linedraw" Width="108" /> </InlineMediaObject> <EquationSource Format="TEX">\(|A_{n-k} |&gt; \underset{i \ne n-k}{|A_i|}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>-</mo> <mi>k</mi> </mrow> </msub> <mrow> <mo stretchy="false">|</mo> <mo>&gt;</mo> </mrow> <munder> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>A</mi> <mi>i</mi> </msub> <mrow> <mo stretchy="false">|</mo> </mrow> </mrow> <mrow> <mi>i</mi> <mo>≠</mo> <mi>n</mi> <mo>-</mo> <mi>k</mi> </mrow> </munder> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_787_Article_IEq6.gif" Format="GIF" Height="30" Rendition="HTML" Resolution="72" Type="Linedraw" Width="196" /> </InlineMediaObject> <EquationSource Format="TEX">\(\deg A_{n-k} &gt; k \ \underset{1 \le i \le k-1}{\max \deg A_{n-i}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>deg</mo> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>-</mo> <mi>k</mi> </mrow> </msub> <mo>&gt;</mo> <mi>k</mi> <mspace width="4pt" /> <munder> <mrow> <mo movablelimits="true">max</mo> <mo>deg</mo> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>-</mo> <mi>i</mi> </mrow> </msub> </mrow> <mrow> <mn>1</mn> <mo>≤</mo> <mi>i</mi> <mo>≤</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mrow> </munder> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_787_Article_IEq7.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="96" /> </InlineMediaObject> <EquationSource Format="TEX">\(k \not | \deg A_{n-k},\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo stretchy="false">|̸</mo> <mo>deg</mo> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>-</mo> <mi>k</mi> </mrow> </msub> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_787_Article_IEq8.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="72" /> </InlineMediaObject> <EquationSource Format="TEX">\( n \ge k+1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, has no root in <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_787_Article_IEq9.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="73" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {F}_q((X^{-1}))\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mrow> <mo stretchy="false">(</mo> <msup> <mi>X</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> with modulus strictly greater than 1. Moreover <i>P</i> is irreducible over <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_787_Article_IEq10.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {F}_q[X]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mrow> <mo stretchy="false">[</mo> <mi>X</mi> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. We provide the generalization of a previous result extended given by Ben Nasr and Kthiri.</p>

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

New irreducibility criterion over \(\mathbb {F}_{q}[X]\)

  • Amara Chandoul

摘要

The aim of this paper is to prove that the polynomial \(P(Y)=Y^n+A_{n-1}Y^{n-1}+\cdots +A_{n-k+1}Y^{n-k+1}+A_{n-k}Y^{n-k}+ \cdots + A_1 Y+ A_0\) P ( Y ) = Y n + A n - 1 Y n - 1 + + A n - k + 1 Y n - k + 1 + A n - k Y n - k + + A 1 Y + A 0 with \(A_0 \ne 0\) A 0 0 , \(|A_{n-k} |> \underset{i \ne n-k}{|A_i|}\) | A n - k | > | A i | i n - k , \(\deg A_{n-k} > k \ \underset{1 \le i \le k-1}{\max \deg A_{n-i}}\) deg A n - k > k max deg A n - i 1 i k - 1 , \(k \not | \deg A_{n-k},\) k deg A n - k , and \( n \ge k+1\) n k + 1 , has no root in \(\mathbb {F}_q((X^{-1}))\) F q ( ( X - 1 ) ) with modulus strictly greater than 1. Moreover P is irreducible over \(\mathbb {F}_q[X]\) F q [ X ] . We provide the generalization of a previous result extended given by Ben Nasr and Kthiri.