Newton polygons and the Prouhet-Tarry-Escott problem

DOI10.1016/J.JNT.2016.10.009MaRDI QIDQ503726zbMATH OpenOpenAlexFDO

Authors Michael Filaseta, Maria Markovich

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

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

Review text

For \(n\geq 2\), the Prouhet-Tarry-Escott (PTE) problem asks for two lists of integers \(X=[x_1,\dots,x_n]\) and \(Y=[y_1,\dots,y_n]\) satisfying \(\sum_{i=1}^n x_i^e=\sum_{i=1}^n y_i^e\) for \(e\in\{1,\dots,k\}\), where \(k\) is an integer in the interval \([2,n-1]\). The authors use Newton polygons to obtain new information on the \(2\)-adic valuation of a certain constant associated with the PTE problem. Further, they give two explicit examples involving the cases \(n=8\) and \(n=9\).

Recommendations

• scientific article; zbMATH DE number 3968721
• A \(\tau \)-conjecture for Newton polygons
• The Newton Polygon and Elliptic Problems with Parameter
• Newton polygons and curve gonalities
• Newton polygons and families of polynomials
• Newton polygons and Newton algorithms
• scientific article; zbMATH DE number 7587781
• On the Newton polygon
• On the Newton polytope of the resultant
• On the algebraic and differential Newton-Puiseux polygons

Cites work

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

Cited in

(11)

• On the algebraic and differential Newton-Puiseux polygons
• Brasselet number and Newton polygons
• A \(\tau \)-conjecture for Newton polygons
• The two-dimensional Prouhet-Tarry-Escott problem
• scientific article; zbMATH DE number 3968721 (Why is no real title available?)
• scientific article; zbMATH DE number 1054784 (Why is no real title available?)
• Newton polygons for a variant of the Kloosterman family
• scientific article; zbMATH DE number 7587781 (Why is no real title available?)
• Shifted power of a polynomial with integral roots
• Newton polygons and the constant associated with the Prouhet-Tarry-Escott problem
• Ideal solutions in the Prouhet-Tarry-Escott problem

This page was built for publication: Newton polygons 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 Q503726)