Show simple item record

Avoiding three consecutive blocks of the same size and same sum

dc.contributor.authorCurrie, James D.
dc.contributor.authorCassaigne, Julien
dc.contributor.authorShallit, Jeffrey O.
dc.contributor.authorSchaeffer, Luke
dc.date.accessioned2019-12-11T18:15:48Z
dc.date.available2019-12-11T18:15:48Z
dc.date.issued2014-04
dc.identifier.citationJ. ACM 61, 2, Article 10 (April 2014), 17 pagesen_US
dc.identifier.urihttp://hdl.handle.net/10680/1761
dc.description.abstractWe show that there exists an infinite 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.isoenen_US
dc.publisherAssociation of Computing Machineryen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMorphism, additive cube, pattern avoidanceen_US
dc.titleAvoiding three consecutive blocks of the same size and same sumen_US
dc.typeArticleen_US
dc.identifier.doi10.1145/2590775en_US


Files in this item

Thumbnail
Name:
1106.5204.pdf
Size:
220.9Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record