A polynomial analogue of Jacobsthal function

DOI10.4213/IM9467EMaRDI QIDQ6425090zbMATH OpenOpenAlexFDO

Authors A. B. Kalmynin, Sergei Konyagin

Publication date 1 February 2023

Full work available at URL https://doi.org/10.4213/im9467e

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32)

Abstract: For a polynomial $f(x)inmathbbZ[x]$ we study an analogue of Jacobsthal function, defined by the formula [ j_f(N)=max_{m}{ ext{For some } xin mathbb N ext{ the inequality } (x+f(i),N)>1 ext{ holds for all }ileq m}. ] We prove a lower bound [ j_f(P(y))gg y(ln y)^{ell_f-1}left(frac{(lnln y)^2}{lnlnln y} ight)^{h_f}left(frac{ln ylnlnln y}{(lnln y)^2} ight)^{M(f)}, ] where $P(y)$ is the product of all primes $p$ below $y$, $el{l}_f$ is the number of distinct linear factors of $f(x)$, $h_f$ is the number of distinct non-linear irreducible factors and $M(f)$ is the average size of the maximal preimage of a point under a map $f:mathbb{F}_{p}omathbb{F}_p$. The quantity $M(f)$ is computed in terms of certain Galois groups.

Recommendations

• Disproof of a conjecture of Jacobsthal
• On Jacobsthal's \(g(n)\)-function
• An upper bound on Jacobsthal's function
• On the number of polynomial maps into Z_n
• Polynomial values free of large prime factors

This page was built for publication: A polynomial analogue of Jacobsthal function

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