2015/12/09 by Ethan D. Bolker, Carl Offner, Robert Richman +1 · 1 citation
Computer Science · Mathematics · #semigroups and automata theory #Advanced Mathematical Identities #Advanced Combinatorial Mathematics #Sequence (biology) #Finite set #Class (philosophy) #Chain (unit) #Extension (predicate logic)
paper · doi:10.4310/joc.2016.v7.n1.a5
openalex publication_date 2015/12/09 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
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.