<p>Cilleruelo conjectured that for an irreducible polynomial <i>f</i> ∈ ℤ[<i>X</i>] of degree <i>d</i> ⩾ 2, denoting <Equation ID="Equa"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11856_2025_2832_Article_Equa.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="251" /> </MediaObject> <EquationSource Format="TEX">\({L_f}(N) = {\text{lcm}}({f(1),f(2), \ldots,f(N)})\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <msub> <mi>L</mi> <mi>f</mi> </msub> </mrow> <mo stretchy="false">(</mo> <mi>N</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mrow> <mtext>lcm</mtext> </mrow> <mo stretchy="false">(</mo> <mrow> <mi>f</mi> <mo stretchy="false">(</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo>,</mo> <mi>f</mi> <mo stretchy="false">(</mo> <mn>2</mn> <mo stretchy="false">)</mo> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mi>f</mi> <mo stretchy="false">(</mo> <mi>N</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">)</mo> </math></EquationSource> </Equation> one has <Equation ID="Equb"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11856_2025_2832_Article_Equb.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="200" /> </MediaObject> <EquationSource Format="TEX">\(\log L_{f}(n)\sim(d-1)N\log N.\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mi>log</mi> <msub> <mi>L</mi> <mrow> <mi>f</mi> </mrow> </msub> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mo>∼</mo> <mo stretchy="false">(</mo> <mi>d</mi> <mo>−</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mi>N</mi> <mi>log</mi> <mi>N</mi> <mo>.</mo> </math></EquationSource> </Equation> He proved it in the case <i>d</i> = 2 but it remains open for every polynomial with <i>d</i> &gt; 2. While the tight upper bound log <i>L</i><sub><i>f</i></sub>(<i>n</i>) ≲ (<i>d</i> − 1)<i>N</i> log <i>N</i> is known, the best known general lower bound due to Sah is <Equation ID="Equc"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11856_2025_2832_Article_Equc.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="150" /> </MediaObject> <EquationSource Format="TEX">\(\log L_{f}(n)\gtrsim N\log N.\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mi>log</mi> <msub> <mi>L</mi> <mrow> <mi>f</mi> </mrow> </msub> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mo>≳</mo> <mi>N</mi> <mi>log</mi> <mi>N</mi> <mo>.</mo> </math></EquationSource> </Equation></p><p>We give an improved lower bound for a special class of irreducible polynomials, which includes the decomposable irreducible polynomials <i>f</i> = <i>g</i> ◦ <i>h, g, h</i> ∈ ℤ[<i>x</i>], deg <i>g</i>, deg <i>h</i> ≥ 2, for which we show <Equation ID="Equd"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11856_2025_2832_Article_Equd.gif" Format="GIF" Height="41" Rendition="HTML" Resolution="72" Type="Linedraw" Width="218" /> </MediaObject> <EquationSource Format="TEX">\(\log {L_f}(n) \gtrsim {{d - 1} \over {d - \deg g}}N\log N.\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mi>log</mi> <mrow> <msub> <mi>L</mi> <mi>f</mi> </msub> </mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mo>≳</mo> <mrow> <mfrac> <mrow> <mi>d</mi> <mo>−</mo> <mn>1</mn> </mrow> <mrow> <mi>d</mi> <mo>−</mo> <mi>deg</mi> <mi>g</mi> </mrow> </mfrac> </mrow> <mi>N</mi> <mi>log</mi> <mi>N</mi> <mo>.</mo> </math></EquationSource> </Equation></p><p>We also improve Sah’s lower bound <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11856_2025_2832_Article_IEq1.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="151" /> </InlineMediaObject> <EquationSource Format="TEX">\(\log {\ell_f}(n) \gtrsim {{2} \over {d}} N\log N\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mi>log</mi> <mrow> <msub> <mi>ℓ</mi> <mi>f</mi> </msub> </mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mo>≳</mo> <mrow> <mfrac> <mrow> <mn>2</mn> </mrow> <mrow> <mi>d</mi> </mrow> </mfrac> </mrow> <mi>N</mi> <mi>log</mi> <mi>N</mi> </math></EquationSource> </InlineEquation> for the radical ℓ<sub><i>f</i></sub> (<i>N</i>) = rad(<i>L</i><sub><i>f</i></sub>(<i>N</i>)) for all irreducible <i>f</i> with <i>d</i> ≥ 3 and give a further improvement for polynomials <i>f</i> with a small Galois group and satisfying an additional technical condition, as well as for decomposable polynomials.</p>

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

Lower bounds on the least common multiple of a polynomial sequence and its radical

  • Alexei Entin

摘要

Cilleruelo conjectured that for an irreducible polynomial f ∈ ℤ[X] of degree d ⩾ 2, denoting \({L_f}(N) = {\text{lcm}}({f(1),f(2), \ldots,f(N)})\) L f ( N ) = lcm ( f ( 1 ) , f ( 2 ) , , f ( N ) ) one has \(\log L_{f}(n)\sim(d-1)N\log N.\) log L f ( n ) ( d 1 ) N log N . He proved it in the case d = 2 but it remains open for every polynomial with d > 2. While the tight upper bound log Lf(n) ≲ (d − 1)N log N is known, the best known general lower bound due to Sah is \(\log L_{f}(n)\gtrsim N\log N.\) log L f ( n ) N log N .

We give an improved lower bound for a special class of irreducible polynomials, which includes the decomposable irreducible polynomials f = gh, g, h ∈ ℤ[x], deg g, deg h ≥ 2, for which we show \(\log {L_f}(n) \gtrsim {{d - 1} \over {d - \deg g}}N\log N.\) log L f ( n ) d 1 d deg g N log N .

We also improve Sah’s lower bound \(\log {\ell_f}(n) \gtrsim {{2} \over {d}} N\log N\) log f ( n ) 2 d N log N for the radical ℓf (N) = rad(Lf(N)) for all irreducible f with d ≥ 3 and give a further improvement for polynomials f with a small Galois group and satisfying an additional technical condition, as well as for decomposable polynomials.