Pure product polynomials and the Prouhet-Tarry-Escott problem

DOI10.1090/S0025-5718-97-00865-XzbMath1036.11539OpenAlexW2009348281MaRDI QIDQ4340872

Roy Maltby

Publication date: 15 June 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-97-00865-x

zbMATH Keywords

Erdős-Szekeres ProblemProuhet-Tarry-Escott ProblemTarry-Escott Problem

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Other combinatorial number theory (11B75)

Related Items (7)

Polynomials with Height 1 and Prescribed Vanishing at 1 ⋮ Upper Bounds for Norms of Products of Binomials ⋮ Newton polygons and the Prouhet-Tarry-Escott problem ⋮ The Prouhet-Tarry-Escott problem for Gaussian integers ⋮ A combinatorial identity of subset-sum powers in rings. ⋮ On lower bounds for Erdős-Szekeres products ⋮ Average growth of \(L_p\) norms of Erdős-Szekeres polynomials

Cites Work

• On Siegel's lemma
• The Prouhet-Tarry-Escott problem revisited
• On a conjecture of Peter Borwein
• Root systems and the Erdős-Szekeres Problem
• The Tarry-Escott Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pure product polynomials and the Prouhet-Tarry-Escott problem