On Prouhet's solution to the equal powers problem (Q387801): Difference between revisions

The classical Tarry-Escott problem is to find two distinct finite sets of integers \(S\) and \(T\), of identical cardinality, such that \(\sum_{s \in S} s^i = \sum_{t \in T} t^i\) for \(0 \leq i < p\). \textit{E. Prouhet} [``Mémoire sur quelques relations entre les puissances des nombres'', C. R. Acad. Sci. Paris 33, 255 (1851)] showed such sets \(S\) and \(T\) exist for every \(p\), and (implicitly) can be specified by positions of symbols in a word obtained by iterating a morphism. In this paper the author generalizes the problem to multisets and semirings, and produces some solutions in matrices. His method is modeled after Prouhet's use of morphisms, but is much more general.