How far are ternary words from shuffle squares?Basu, Ayush (Avtor) Ruciński, Andrzej (Avtor) words over finite alphabettwins in wordsshuffle squaresA 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.Založba Univerze na Primorskem20252025-10-22 13:16:36Članek v reviji22012UDK: 51eISSN: 1855-3974DOI: https://doi.org/10.26493/1855-3974.3211.86dsl