Newton polygons and the Prouhet-Tarry-Escott problem

DOI10.1016/j.jnt.2016.10.009zbMath1396.11057OpenAlexW2558132777MaRDI QIDQ503726

Maria Markovich, Michael Filaseta

Publication date: 23 January 2017

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2016.10.009

zbMATH Keywords

Newton polygonsp-adicProuhet-Tarry-Escott problem

Mathematics Subject Classification ID

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

Related Items (1)

Shifted power of a polynomial with integral roots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irreducibility criteria of Schur-type and Pólya-type
• Computational excursions in analysis and number theory
• The Prouhet-Tarry-Escott problem revisited
• Ideal solutions of the Tarry-Escott problem of degrees four and five and related Diophantine systems.
• Subword balance, position indices and power sums
• The two-dimensional Prouhet-Tarry-Escott problem
• Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott prob\-lem
• Few Product Gates But Many Zeros
• Prouhet's 1851 Solution of the Tarry-Escott Problem of 1910
• An note on the Tarry-Escott problem.
• The Tarry-Escott and the „easier“ Waring problems
• Pure product polynomials and the Prouhet-Tarry-Escott problem
• Computational investigations of the Prouhet-Tarry-Escott Problem
• The Prouhet-Tarry-Escott problem for Gaussian integers
• ON TARRY'S PROBLEM (I)

This page was built for publication: Newton polygons and the Prouhet-Tarry-Escott problem