Year: 2024
Type: article
Abstract: A shuffle square is a word which consists of two identical and disjoint, but possibly intertwining subwords. For every natural number n, we construct a ternary word of length n which requires a removal of at least Ω(log²n) of its letters in order to become a shuffle square.
Source: Ars Mathematica Contemporanea
Authors: Ayush Basu, Andrzej Ruciński
Institutions: Emory University, Adam Mickiewicz University in Poznań
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4405418189