Abstract
Eugène Prouhet is considered to be one of the fathers of combinatorics on words. In his pioneering work, he constructed a solution to the equal powers problem in number theory (later known as the Prouhet–Tarry–Escott problem) based on positions of symbols in words obtained by iteration of a uniform endomorphism of the free monoid over a finite alphabet. We show that composition of uniform morphisms of free monoids is a fairly powerful tool to obtain solutions to a more general problem, which covers the major generalizations of Prouhet’s theorem appearing in literature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
