Back to Search
Start Over
A Separation of $\gamma$ and $b$ via Thue--Morse Words
- Publication Year :
- 2021
-
Abstract
- We prove that for $n\geq 2$, the size $b(t_n)$ of the smallest bidirectional scheme for the $n$th Thue--Morse word $t_n$ is $n+2$. Since Kutsukake et al. [SPIRE 2020] show that the size $\gamma(t_n)$ of the smallest string attractor for $t_n$ is $4$ for $n \geq 4$, this shows for the first time that there is a separation between the size of the smallest string attractor $\gamma$ and the size of the smallest bidirectional scheme $b$, i.e., there exist string families such that $\gamma = o(b)$.
- Subjects :
- Computer Science - Discrete Mathematics
Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2104.09985
- Document Type :
- Working Paper