<p>The main purpose of this article is to extract infinite families of polynomials of the form <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq1.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="161" /> </InlineMediaObject> <EquationSource Format="TEX">\( t^n + c(at^k + b)^m \in \mathbb {Z}[t] \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>t</mi> <mi>n</mi> </msup> <mo>+</mo> <mi>c</mi> <msup> <mrow> <mo stretchy="false">(</mo> <mi>a</mi> <msup> <mi>t</mi> <mi>k</mi> </msup> <mo>+</mo> <mi>b</mi> <mo stretchy="false">)</mo> </mrow> <mi>m</mi> </msup> <mo>∈</mo> <mi mathvariant="double-struck">Z</mi> <mrow> <mo stretchy="false">[</mo> <mi>t</mi> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\( k \ge 2 \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation> and the degree <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq3.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="86" /> </InlineMediaObject> <EquationSource Format="TEX">\( n &gt; mk + 1 \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>&gt;</mo> <mi>m</mi> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> is fixed, such that the discriminants are not necessarily squarefree, yet the polynomials are either monogenic or possess the full symmetric group as their Galois group. In particular, we establish lower bounds on the number of monogenic polynomials of this form for the cases <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="20" /> </InlineMediaObject> <EquationSource Format="TEX">\((i)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>i</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq5.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\( m = 1 \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, and <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="25" /> </InlineMediaObject> <EquationSource Format="TEX">\((ii)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>i</mi> <mi>i</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq7.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="39" /> </InlineMediaObject> <EquationSource Format="TEX">\( b = 1 \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>b</mi> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> when <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq8.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\( m \ge 2 \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>. Furthermore, for any prime number <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq9.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\( p \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>p</mi> </math></EquationSource> </InlineEquation>, we provide a lower bound on the number of monogenic polynomials of the form <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq10.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="160" /> </InlineMediaObject> <EquationSource Format="TEX">\( t^p + c(at^k + b)^m \in \mathbb {Z}[t] \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>t</mi> <mi>p</mi> </msup> <mo>+</mo> <mi>c</mi> <msup> <mrow> <mo stretchy="false">(</mo> <mi>a</mi> <msup> <mi>t</mi> <mi>k</mi> </msup> <mo>+</mo> <mi>b</mi> <mo stretchy="false">)</mo> </mrow> <mi>m</mi> </msup> <mo>∈</mo> <mi mathvariant="double-struck">Z</mi> <mrow> <mo stretchy="false">[</mo> <mi>t</mi> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> of degree <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq9.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\( p \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>p</mi> </math></EquationSource> </InlineEquation>, whose Galois group over <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq12.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\( \mathbb {Q} \)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">Q</mi> </math></EquationSource> </InlineEquation> is isomorphic to the symmetric group <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1110_Article_IEq13.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\( S_p \)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>S</mi> <mi>p</mi> </msub> </math></EquationSource> </InlineEquation>.</p>

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

Monogenic polynomials and symmetric Galois groups: a quantitative study

  • Anuj Jakhar,
  • Srinivas Kotyada,
  • Arunabha Mukhopadhyay

摘要

The main purpose of this article is to extract infinite families of polynomials of the form \( t^n + c(at^k + b)^m \in \mathbb {Z}[t] \) t n + c ( a t k + b ) m Z [ t ] , where \( k \ge 2 \) k 2 and the degree \( n > mk + 1 \) n > m k + 1 is fixed, such that the discriminants are not necessarily squarefree, yet the polynomials are either monogenic or possess the full symmetric group as their Galois group. In particular, we establish lower bounds on the number of monogenic polynomials of this form for the cases \((i)\) ( i ) \( m = 1 \) m = 1 , and \((ii)\) ( i i ) \( b = 1 \) b = 1 when \( m \ge 2 \) m 2 . Furthermore, for any prime number \( p \) p , we provide a lower bound on the number of monogenic polynomials of the form \( t^p + c(at^k + b)^m \in \mathbb {Z}[t] \) t p + c ( a t k + b ) m Z [ t ] of degree \( p \) p , whose Galois group over \( \mathbb {Q} \) Q is isomorphic to the symmetric group \( S_p \) S p .