S-parts of values of univariate polynomials, binary forms and decomposable forms at integral points
Yann Bugeaud, Jan-Hendrik Evertse, K\'alm\'an Gy\H{o}ry

TL;DR
This paper investigates bounds on the $S$-part of polynomial and form values at integers, extending previous results with new inequalities, density estimates, and generalizations to binary and decomposable forms using advanced number theory tools.
Contribution
It extends bounds on the $S$-part of polynomial values, generalizes results to binary and decomposable forms, and provides density estimates using modern Diophantine approximation techniques.
Findings
Inequality $[f(x)]_S \
c \
d<1$ holds for polynomials with roots, with $d>1/n$ under certain conditions.
Abstract
Let be a finite set of primes. The -part of a non-zero integer is the largest positive divisor of that is composed of primes from . In 2013, Gross and Vincent proved that if is a polynomial with integer coefficients and with at least two roots in the complex numbers, then for every integer at which is non-zero, we have (*) , where and are effectively computable and . Their proof uses Baker-type estimates for linear forms in complex logarithms of algebraic numbers. As an easy application of the -adic Thue-Siegel-Roth theorem we show that if has degree and no multiple roots, then an inequality such as (*) holds for all , provided we do not require effectivity of . Further, we show that such an inequality does not hold anymore with and sufficiently small . In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
