The Prouhet-Tarry-Escott problem and generalized Thue-Morse sequences

DOI10.4310/JOC.2016.V7.N1.A5MaRDI QIDQ5963388zbMATH OpenFDO

Authors Ethan D. Bolker, Carl Offner, Robert Richman, Catalin Zara

Publication date 19 February 2016

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.6756

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorics on words (68R15)

Abstract: We present new methods of generating Prouhet-Tarry-Escott partitions of arbitrarily large regularity. One of these methods generalizes the construction of the Thue-Morse sequence to finite alphabets with more than two letters. We show how one can use such partitions to (theoretically) pour the same volume coffee from an urn into a finite number of cups so that each cup gets almost the same amount of caffeine.

Recommendations

• A new proof of the Prouhet-Tarry-Escott problem
• On Prouhet's solution to the equal powers problem
• Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms
• The Prouhet-Tarry-Escott problem revisited
• Sums of like powers and some dense sets

Cited in

(8)

• scientific article; zbMATH DE number 1195740 (Why is no real title available?)
• Generalized Wong sequences and their applications to Edmonds' problems
• scientific article; zbMATH DE number 6257981 (Why is no real title available?)
• Normality of the Thue-Morse sequence along Piatetski-Shapiro sequences. II
• On a sequence related to that of Thue-Morse and its applications
• Coquet-type formulas for the rarefied weighted Thue-Morse sequence
• Generalized Wong sequences and their applications to Edmonds' problems
• An improvement of Prouhet's 1851 result on multigrade chains

This page was built for publication: The Prouhet-Tarry-Escott problem and generalized Thue-Morse sequences

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