A polynomial analogue of Jacobsthal function

TL;DR

This paper introduces a polynomial analogue of the Jacobsthal function, establishing a lower bound that involves the polynomial's factorization properties and Galois groups, extending classical number theory concepts.

Contribution

It defines a new polynomial-based Jacobsthal function and derives a non-trivial lower bound involving polynomial factorization and Galois group data.

Findings

Established a lower bound for the polynomial Jacobsthal function.

Connected the bound to polynomial factorization and Galois group properties.

Extended classical Jacobsthal function concepts to polynomial settings.

Abstract

For a polynomial $f(x)\in \mathbb Z[x]$ we study an analogue of Jacobsthal function, defined by the formula \[ j_f(N)=\max_{m}\{\text{For some } x\in \mathbb N \text{ the inequality } (x+f(i),N)>1 \text{ holds for all }i\leq m\}. \] We prove a lower bound \[ j_f(P(y))\gg y(\ln y)^{\ell_f-1}\left(\frac{(\ln\ln y)^2}{\ln\ln\ln y}\right)^{h_f}\left(\frac{\ln y\ln\ln\ln y}{(\ln\ln y)^2}\right)^{M(f)}, \] where $P(y)$ is the product of all primes $p$ below $y$, $\ell_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\to \mathbb F_p$. The quantity $M(f)$ is computed in terms of certain Galois groups.