An improved bound on the least common multiple of polynomial sequences

DOI10.5802/JTNB.1146MaRDI QIDQ2219660zbMATH OpenOpenAlexFDO

Authors Ashwin Sah

Publication date 20 January 2021

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://arxiv.org/abs/1911.00168

zbMATH Keywords

least common multiplepolynomial sequence

Mathematics Subject Classification ID

Primes represented by polynomials; other multiplicative structures of polynomial values (11N32)

Abstract: Cilleruelo conjectured that if $finmathbbZ[x]$ of degree $dge2$ is irreducible over the rationals, then $logoperatornamelcm(f(1),ldots,f(N))sim(d-1)NlogN$ as $Noinfty$. He proved it for the case $d=2$. Very recently, Maynard and Rudnick proved there exists $c_d>0$ with $logoperatornamelcm(f(1),ldots,f(N))gtrsim{c}_{d}NlogN$, and showed one can take $c_d=fracd-1d^2$. We give an alternative proof of this result with the improved constant $c_d=1$. We additionally prove the bound $logoperatornameradoperatornamelcm(f(1),ldots,f(N))gtrsimfrac2dNlogN$ and make the stronger conjecture that $logoperatornameradoperatornamelcm(f(1),ldots,f(N))sim(d-1)NlogN$ as $Noinfty$.

Recommendations

• A lower bound on the least common multiple of polynomial sequences
• Uniform lower bound for the least common multiple of a polynomial sequence
• On Cilleruelo's conjecture for the least common multiple of polynomial sequences
• Nontrivial lower bounds for the least common multiple of some finite sequences of integers
• On the least common multiple of polynomial sequences at prime arguments

Cites work

• A lower bound on the least common multiple of polynomial sequences
• scientific article; zbMATH DE number 7069711 (Why is no real title available?)
• The least common multiple of a quadratic sequence
• The least common multiple of a sequence of products of linear polynomials
• Uniform lower bound for the least common multiple of a polynomial sequence

Cited in

(12)

• On Cilleruelo's conjecture for the least common multiple of polynomial sequences
• On the least common multiple of random \(q\)-integers
• scientific article; zbMATH DE number 5525675 (Why is no real title available?)
• Uniform lower bound for the least common multiple of a polynomial sequence
• A lower bound on the least common multiple of polynomial sequences
• scientific article; zbMATH DE number 6401736 (Why is no real title available?)
• On the least common multiple of polynomial sequences at prime arguments
• Sums of two squares and the tau-function: Ramanujan's trail
• Random Chowla's conjecture for Rademacher multiplicative functions
• The least common multiple of polynomial values over function fields
• Lower bounds on the least common multiple of a polynomial sequence and its radical
• Zero sums amongst roots and Cilleruelo's conjecture on the LCM of polynomial sequences

This page was built for publication: An improved bound on the least common multiple of polynomial sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219660)