Polynomial values of products of terms from an arithmetic progression (Q2006792): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial values of sums of products of consecutive integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjecture of Erdős, supersingular primes and short character sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diophantine equation x(x+1)...(x+(m-1)) + r= y<sup>n</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diophantine equation f(x) = g(y) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(S\)-integral solutions of the equation \(y^ m=f(x)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4533267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equations <i>z<sup>m</sup> </i> = <i>F</i> (<i>x, y</i> ) and <i>Ax<sup>p</sup> </i> + <i>By<sup>q</sup> </i> = <i>Cz<sup>r</sup> </i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Diophantine Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The product of consecutive integers is never a power / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diophantine equation ${n \choose k} = x^l$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect powers from products of consecutive terms in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diophantine Equation <i>n</i>(<i>n</i> + <i>d</i>) · · · (<i>n</i> + (<i>k</i> − 1)<i>d</i>) = <i>by</i><sup><i>l</i></sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equal values of standard counting polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power values of sums of products of consecutive integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equal values of figurate numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diophantine equation \(x(x + 1)(x + 2)\dots (x + (m - 1)) =g(y)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost perfect powers in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equation n(n+d)⋅⋅⋅(n+(i<sub>0</sub>-1)d)(n+(i<sub>0</sub>+1)d)⋅⋅⋅(n+(k-1)d)=y<sup>l</sup>with 0&lt;i<sub>0</sub>&lt;k-1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equation $y^m = P(x)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324063 / rank
 
Normal rank

Latest revision as of 18:57, 23 July 2024

scientific article
Language Label Description Also known as
English
Polynomial values of products of terms from an arithmetic progression
scientific article

    Statements

    Polynomial values of products of terms from an arithmetic progression (English)
    0 references
    0 references
    0 references
    12 October 2020
    0 references
    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)\).
    0 references
    Bilu-Tichy theorem
    0 references
    decomposability
    0 references
    Diophantine equations \(f(x)=g(y)\)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers