The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations

DOI10.1007/S11139-022-00555-7zbMATH Open1496.11126OpenAlexW4223613088MaRDI QIDQ2155868FDOQ2155868

R. Tijdeman, Á. Papp, Lajos Hajdu

Publication date: 15 July 2022

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11139-022-00555-7

zbMATH Keywords

symmetric polynomialsProuhet-Tarry-Escott problempolynomial valuesproducts of consecutive integersindecomposability of polynomialspartitions of \(\{1,\dots,n\}\)

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Waring's problem and variants (11P05) Higher degree equations; Fermat's equation (11D41)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The product of consecutive integers is never a power
• A polynomial time algorithm for computing all minimal decompositions of a polynomial
• The Diophantine equation x(x+1)...(x+(m-1)) + r= yⁿ
• On a theorem of Ritt and related Diophantine problems.
• The Diophantine equation f(x) = g(y)
• EQUATIONS OF THE FORM f(x)=g(y)
• On the diophantine equation ${n \choose k} = x^l$
• On the equation $y^m = P(x)$
• On \(S\)-integral solutions of the equation \(y^ m=f(x)\)
• On the Diophantine equation \(x(x + 1)(x + 2)\dots (x + (m - 1)) =g(y)\)
• On a Diophantine Equation
• Almost perfect powers in arithmetic progression
• Equal binomial coefficients: Some elementary considerations
• On the equation n(n+d)⋅⋅⋅(n+(i₀-1)d)(n+(i₀+1)d)⋅⋅⋅(n+(k-1)d)=y^lwith 0<i₀<k-1
• A conjecture of Erdős, supersingular primes and short character sums
• Polynomial values of products of terms from an arithmetic progression
• On the Diophantine equation \(\binom{n}{k} = \binom{m}{l} + d\)

Cited In (4)

• The Diophantine equation f(x)=g(y)$f(x)=g(y)$ for polynomials with simple rational roots
• Shifted power of a polynomial with integral roots
• INDECOMPOSABILITY OF POLYNOMIALS AND RELATED DIOPHANTINE EQUATIONS
• Extrema of polynomials with real roots and Diophantine equations

This page was built for publication: The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155868)