Polynomial values of products of terms from an arithmetic progression
type: Item
instance of: scholarly article
title: Polynomial values of products of terms from an arithmetic progression
zbMATH Open document ID: 1453.11048
author: Lajos Hajdu
author: Á. Papp
published in: Monatshefte für Mathematik
publication date: 2020-10-12T00:00:00Z
review text: In [Acta Arith. 95, No. 3, 261--288 (2000; Zbl 0958.11049)] \textit{Y. F. Bilu} and \textit{R. F. Tichy} proved a remarkable result that enables a useful way to apply Siegel's theorem on integral points which is not effective, to prove finiteness theorems on Diophantine equations. Since then, there has been a deluge of papers on Diophantine equations of the form \(f(x)=g(y)\) for polynomials \(f,g\) to which the first author has also contributed extensively. In the paper under review, the authors consider the Diophantine equations of the form \(f_{k,j}(x) = g(y)\), where \(g \in \mathbb{Q}[y]\) has degree \(\geq 2\) and \[f_{k,j}(x) = x(x+d) \cdots (x+(j-1)d)(x+(j+1)d) \cdots (x+(k-1)d)\] where \(d \neq 0, 0 \leq j < k\). Note that one takes \(k \geq 3\) so that we do have a polynomial. Using the Bilu-Tichy theorem, they obtain finiteness results when \(k \geq 8\); the results are ineffective of course. In the special case, when \(g(y) = ay^n+b\) with \(n \geq 2\) and \(a,b \in \mathbb{Q}\), they are able to obtain effective results. Finally, the authors obtain (in the reviewer's opinion, the most interesting) results on the decomposability of the polynomials \(f_{j,k}(x)\).
Mathematics Subject Classification ID: 11D41
zbMATH DE Number: 7259090
zbMATH Keywords: Bilu-Tichy theorem
zbMATH Keywords: decomposability
zbMATH Keywords: Diophantine equations \(f(x)=g(y)\)
reviewed by: Balasubramanian Sury
MaRDI profile type: Publication
full work available at URL: s00605-020-01422-7
OpenAlex ID: W3022503475
cites work: Polynomial values of sums of products of consecutive integers
cites work: A conjecture of Erdős, supersingular primes and short character sums
cites work: Q4231637
cites work: Q4252148
cites work: The Diophantine equation x(x+1)...(x+(m-1)) + r= yn
cites work: The Diophantine equation f(x) = g(y)
cites work: On \(S\)-integral solutions of the equation \(y^ m=f(x)\)
cites work: Q4533267
cites work: On the Equations zm = F (x, y ) and Axp + Byq = Czr
cites work: On a Diophantine Equation
cites work: The product of consecutive integers is never a power
cites work: On the diophantine equation ${n \choose k} = x^l$
cites work: Perfect powers from products of consecutive terms in arithmetic progression
cites work: On the Diophantine Equation n(n + d) · · · (n + (k − 1)d) = byl
cites work: Equal values of standard counting polynomials
cites work: Power values of sums of products of consecutive integers
cites work: Equal values of figurate numbers
cites work: On the Diophantine equation \(x(x + 1)(x + 2)\dots (x + (m - 1)) =g(y)\)
cites work: Q4325515
cites work: Almost perfect powers in arithmetic progression
cites work: Q4432173
cites work: On the equation n(n+d)⋅⋅⋅(n+(i0-1)d)(n+(i0+1)d)⋅⋅⋅(n+(k-1)d)=ylwith 0<i0<k-1
cites work: On the equation $y^m = P(x)$
cites work: Q4820763
cites work: Q4101902
cites work: Q4324063
DOI: 10.1007/S00605-020-01422-7
Recommended article: Q5188092
Recommended article: INDECOMPOSABILITY OF POLYNOMIALS AND RELATED DIOPHANTINE EQUATIONS
Recommended article: Q4533267
Recommended article: Diophantine equations with Euler polynomials
Recommended article: On special extrema of polynomials with applications to Diophantine problems
Recommended article: On linear combinations of products of consecutive integers
Recommended article: Functional composition of polynomials: indecomposability, Diophantine equations and lacunary polynomials
Recommended article: Quadratic factors of f(x) -g(y)
Recommended article: On blocks of arithmetic progressions with equal products
Recommended article: Polynomial values of surface point counting polynomials
description: scientific article; zbMATH DE number 7259090