Avoiding three consecutive blocks of the same size and same sum

dc.contributor.author	Currie, James D.
dc.contributor.author	Cassaigne, Julien
dc.contributor.author	Shallit, Jeffrey O.
dc.contributor.author	Schaeffer, Luke
dc.date.accessioned	2019-12-11T18:15:48Z
dc.date.available	2019-12-11T18:15:48Z
dc.date.issued	2014-04
dc.identifier.citation	J. ACM 61, 2, Article 10 (April 2014), 17 pages	en_US
dc.identifier.uri	http://hdl.handle.net/10680/1761
dc.description.abstract	We show that there exists an inﬁnite word over the alphabet {0,1,3,4} containing no three consecutive blocks of the same size and the same sum. This answers an open problem of Pirillo and Varricchio from1994.	en_US
dc.language.iso	en	en_US
dc.publisher	Association of Computing Machinery	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.subject	Morphism, additive cube, pattern avoidance	en_US
dc.title	Avoiding three consecutive blocks of the same size and same sum	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1145/2590775	en_US