The Prouhet-Tarry-Escott Problem and Generalized Thue-Morse Sequences
Combinatorics
2018-10-09 v1
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.
Cite
@article{arxiv.1304.6756,
title = {The Prouhet-Tarry-Escott Problem and Generalized Thue-Morse Sequences},
author = {Ethan D. Bolker and Carl Offner and Robert Richman and Catalin Zara},
journal= {arXiv preprint arXiv:1304.6756},
year = {2018}
}