Pure product polynomials and the Prouhet-Tarry-Escott problem

DOI10.1090/S0025-5718-97-00865-XzbMATH Open1036.11539OpenAlexW2009348281MaRDI QIDQ4340872FDOQ4340872

Authors: 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

Recommendations

• Root systems and the Erdős-Szekeres Problem
• The Prouhet-Tarry-Escott problem revisited
• A POLYNOMIAL VARIANT OF A PROBLEM OF DIOPHANTUS FOR PURE POWERS

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On Siegel's lemma
• The Prouhet-Tarry-Escott problem revisited
• On a conjecture of Peter Borwein
• Title not available (Why is that?)
• Functional analysis.
• The Tarry-Escott Problem
• Title not available (Why is that?)
• Root systems and the Erdős-Szekeres Problem

Cited In (9)

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

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

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