| Title: | How far are ternary words from shuffle squares? |
|---|
| Authors: | ID Basu, Ayush (Author)
ID Ruciński, Andrzej (Author) |
|---|
| Files: |  AMC_Basu,Ruciński_2025.pdf (286,72 KB)
MD5: D1E6CEBF4CE1883A9F9B65920DA8311C
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| 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. |
|---|
| Keywords: | words over finite alphabet, twins in words, shuffle squares |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 19.06.2025 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | 9 str. |
|---|
| Numbering: | Vol. 25, no. 3, [article no.] P3.08 |
|---|
| PID: | 20.500.12556/RUP-22012  |
|---|
| UDC: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | https://doi.org/10.26493/1855-3974.3211.86d |
|---|
| Publication date in RUP: | 22.10.2025 |
|---|
| Views: | 243 |
|---|
| Downloads: | 1 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
