The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations (Q2155868): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11139-022-00555-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4223613088 / 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: 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: A polynomial time algorithm for computing all minimal decompositions of a polynomial / 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: EQUATIONS OF THE FORM <i>f</i>(<i>x</i>)=<i>g</i>(<i>y</i>) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equal binomial coefficients: Some elementary considerations / 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 a theorem of Ritt and related Diophantine problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diophantine equation \(\binom{n}{k} = \binom{m}{l} + d\) / 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: Polynomial values of products of terms from an arithmetic progression / 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 15:04, 29 July 2024

scientific article
Language Label Description Also known as
English
The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations
scientific article

    Statements

    The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations (English)
    0 references
    0 references
    0 references
    0 references
    15 July 2022
    0 references
    In this interesting paper the authors relate three topics: the Prouhet-Tarry-Escott problem, the indecomposability of polynomials and Diophantine equations. To be more precise, the following problem is considered: Let \(r\in\mathbb{N}\). Describe those positive integers \(n\) such that the set \(\{1,\ldots, n\}\) can be partitioned into sets \(A_{0},\ldots, A_{t}\) with \(|A_{0}|=r, t\geq 2\) and \(k=|A_{1}|=\ldots=|A_{t}|\geq 2\) such that all symmetric polynomials \(\sigma_{1}, \ldots, \sigma_{k-1}\) of the elements of \(A_{i}, i=1, \ldots, t,\) coincide. For \(r=1, t=2, n=2k+1\) this is classical Prouhet-Tarry-Escott problem. The authors prove that if \(r\) is small enough with respect to \(n\) (in fact, as is proved in the paper, it is enough to have \(n>2r^{3/2}+5r+8\)), then only \(k=2\) is possible and the sets \(A_{i}\) have the special property. Next, it is shown that the existence of the partition under consideration is equivalent with the existence of a set \(A\subset \mathbb{N}\) such that the polynomial of the form \(f(x)=\prod_{a\in A}(x-a)\) is decomposable over \(\mathbb{Q}\), i.e., there exist polynomials \(h_{1}, h_{2}\in\mathbb{Q}[x]\) of degree \(\geq 2\) such that \(f(x)=h_{1}(h_{2}(x))\). Finally, the obtained results are used to the construction of a broad family of polynomials \(F\) having only integer roots and the property that the Diophantine equation \(F(x)=P(y)\), where \(P\in\mathbb{Q}\) is of degree \(\geq 2\), has only finitely many solutions in integers, provided \(P\) satisfies certain technical (but natural) assumptions. These results are ineffective. Some effective results are presented in the case of special sets \(A\) and polynomials of the form \(P(x)=ax^l+b\in\mathbb{Q}[x], l\geq 2\).
    0 references
    0 references
    partitions of \(\{1,\dots,n\}\)
    0 references
    symmetric polynomials
    0 references
    Prouhet-Tarry-Escott problem
    0 references
    products of consecutive integers
    0 references
    indecomposability of polynomials
    0 references
    polynomial values
    0 references

    Identifiers