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

From MaRDI portal
Publication:5963388

DOI10.4310/JOC.2016.V7.N1.A5zbMATH Open1336.68208arXiv1304.6756MaRDI QIDQ5963388FDOQ5963388

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

Publication date: 19 February 2016

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

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.


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




Recommendations




Cited In (8)





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)