{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:54:11Z","timestamp":1760057651500,"version":"build-2065373602"},"reference-count":13,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T00:00:00Z","timestamp":1739750400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>A square is a word of the form XX, where X is any finite non-empty word. For example, couscous is a square. A shuffle square is a finite word that can be formed by self-shuffling a word; for instance, the Spanish word acaece is a shuffle square but not a square. We discuss both known and novel enumerative problems related to shuffle squares, with a focus on the number of distinct roots of binary shuffle squares. We introduce the term explicit shuffle squares, propose several conjectures, and present some preliminary results towards their resolution. Our discussion is supported by computational experiments. In particular, we determine the exact number of distinct roots of binary shuffle squares with a length of up to 24. On the other hand, we show that every non-constant binary word of length n generates at least n different shuffle squares.<\/jats:p>","DOI":"10.3390\/sym17020305","type":"journal-article","created":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T07:48:22Z","timestamp":1739778502000},"page":"305","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Roots of Binary Shuffle Squares"],"prefix":"10.3390","volume":"17","author":[{"given":"Dominika","family":"Datko","sequence":"first","affiliation":[{"name":"Institute of Mathematics, Silesian University of Technology, 44-100 Gliwice, Poland"}]},{"given":"Bart\u0142omiej","family":"Pawlik","sequence":"additional","affiliation":[{"name":"Institute of Mathematics, Silesian University of Technology, 44-100 Gliwice, Poland"}]}],"member":"1968","published-online":{"date-parts":[[2025,2,17]]},"reference":[{"key":"ref_1","first-page":"1","article-title":"\u00dcber unendliche Zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1016\/j.ejc.2005.07.019","article-title":"The origins of combinatorics on words","volume":"28","author":"Berstel","year":"2007","journal-title":"Eur. J. Comb."},{"key":"ref_3","first-page":"131","article-title":"Shuffling and Unshuffling","volume":"107","author":"Henshall","year":"2012","journal-title":"Bull. EATCS"},{"key":"ref_4","unstructured":"(2025, January 02). Available online: https:\/\/oeis.org\/A191755."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"103883","DOI":"10.1016\/j.ejc.2023.103883","article-title":"Shuffle Squares and Reverse Shuffle Squares","volume":"116","author":"He","year":"2024","journal-title":"Eur. J. Comb."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1016\/j.jcta.2013.01.001","article-title":"A regularity lemma and twins in words","volume":"120","author":"Axenovich","year":"2013","journal-title":"J. Combin. Theory Ser. A"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Basu, A., and Ruci\u0144ski, A. (2024). How far are ternary words from shuffle squares?. Ars Math. Contemp.","DOI":"10.26493\/1855-3974.3211.86d"},{"key":"ref_8","unstructured":"Fici, G. (2024). The Shortest Interesting Binary Words. arXiv."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Grytczuk, J., Pawlik, B., and Pleszczy\u0144ski, M. (2023). More Variations on Shuffle Squares. Symmetry, 15.","DOI":"10.3390\/sym15111982"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Grytczuk, J., Pawlik, B., and Pleszczy\u0144ski, M. (2024). Variations on shuffle squares. arXiv.","DOI":"10.3390\/sym15111982"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1016\/j.jcss.2013.11.002","article-title":"Unshuffling a square is NP-hard","volume":"80","author":"Buss","year":"2014","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.tcs.2019.01.012","article-title":"Recognizing binary shuffle squares is NP-hard","volume":"806","author":"Bulteau","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"ref_13","unstructured":"(2025, January 02). Available online: https:\/\/oeis.org\/A331850."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/2\/305\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:36:22Z","timestamp":1760027782000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/2\/305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,17]]},"references-count":13,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["sym17020305"],"URL":"https:\/\/doi.org\/10.3390\/sym17020305","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2025,2,17]]}}}