{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:42Z","timestamp":1759638462551},"reference-count":10,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T00:00:00Z","timestamp":1464825600000},"content-version":"vor","delay-in-days":153,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2016,3,24]]},"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>A shuffle square is a word that can be partitioned into two identical words. We obtain a\n          short proof that there exist exponentially many words over the 7 letter alphabet\n          containing no shuffle square as a factor. The method is a generalization of the so-called\n          power series method using ideas of the entropy compression method as developped by\n          Gon\u00e7alves <jats:italic>et al. <\/jats:italic>[Entropy compression method applied to graph colorings.\n          <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"http:\/\/arxiv.org\/abs\/1406.4380\">arXiv:1406.4380<\/jats:ext-link>].<\/jats:p>","DOI":"10.1051\/ita\/2016007","type":"journal-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T06:32:10Z","timestamp":1464849130000},"page":"101-103","source":"Crossref","is-referenced-by-count":6,"title":["A short proof that shuffle squares are 7-avoidable"],"prefix":"10.1051","volume":"50","author":[{"given":"Guillaume","family":"Gu\u00e9gan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Ochem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2016,6,2]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1016\/j.ic.2007.02.004","volume":"205","author":"Bell","year":"2007","journal-title":"Inform. Comput."},{"key":"R2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.tcs.2013.08.010","volume":"506","author":"Blanchet-Sadri","year":"2013","journal-title":"Theor. Comput. Sci."},{"key":"R3","unstructured":"J. Currie, Shuffle squares are avoidable.\n          Manuscript."},{"key":"R4","unstructured":"D. Gon\u00e7alves, M. Montassier and A. Pinlou, Entropy\n          compression method applied to graph colorings. Preprint arXiv:1406.4380 (2015)."},{"key":"R5","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1002\/rsa.20411","volume":"42","author":"Grytczuk","year":"2013","journal-title":"Random Structures & Algorithms"},{"key":"R6","unstructured":"J. Grytczuk, J. Kozik and B. Zaleski, Avoiding\n          tight twins in sequences by entropy compression. Available at http:\/\/ssdnm.mimuw.edu.pl\/pliki\/prace-studentow\/st\/pliki\/bartosz-zaleski-3.pdf"},{"key":"R7","unstructured":"M. M\u00fcller, Avoiding and enforcing\n            repetitive structures in words. Ph.D. thesis (2014)."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"P. Ochem, Doubled patterns are 3-avoidable. Preprint arXiv:1510.01753 (2015).","DOI":"10.37236\/5618"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Ochem P. and Pinlou A., Application of entropy\n            compression in pattern avoidance. Electron. J.\n              Combin.\n          21 (2014) #RP2.7.","DOI":"10.37236\/3038"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Rampersad N., Further applications of a\n            power series method for pattern avoidance. Electron. J.\n              Combin.\n          18 (2011) #P134.","DOI":"10.37236\/621"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2016007\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T11:54:05Z","timestamp":1630670045000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2016007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":10,"journal-issue":{"issue":"1"},"alternative-id":["ita160028"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2016007","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}