The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations
Publication:2155868
DOI10.1007/S11139-022-00555-7zbMath1496.11126OpenAlexW4223613088MaRDI QIDQ2155868
Á. Papp, Lajos Hajdu, Robert Tijdeman
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
symmetric polynomialsProuhet-Tarry-Escott problempolynomial valuesproducts of consecutive integersindecomposability of polynomialspartitions of \(\{1,\dots,n\}\)
Waring's problem and variants (11P05) Other combinatorial number theory (11B75) Higher degree equations; Fermat's equation (11D41)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(S\)-integral solutions of the equation \(y^ m=f(x)\)
- The product of consecutive integers is never a power
- Equal binomial coefficients: Some elementary considerations
- On the Diophantine equation \(x(x + 1)(x + 2)\dots (x + (m - 1)) =g(y)\)
- Polynomial values of products of terms from an arithmetic progression
- On the Diophantine equation \(\binom{n}{k} = \binom{m}{l} + d\)
- A conjecture of Erdős, supersingular primes and short character sums
- Almost perfect powers in arithmetic progression
- On the equation $y^m = P(x)$
- On the diophantine equation ${n \choose k} = x^l$
- On a theorem of Ritt and related Diophantine problems.
- The Diophantine equation f(x) = g(y)
- The Diophantine equation x(x+1)...(x+(m-1)) + r= yn
- A polynomial time algorithm for computing all minimal decompositions of a polynomial
- On the equation n(n+d)⋅⋅⋅(n+(i0-1)d)(n+(i0+1)d)⋅⋅⋅(n+(k-1)d)=ylwith 0<i0<k-1
- EQUATIONS OF THE FORM f(x)=g(y)
- On a Diophantine Equation
This page was built for publication: The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations