Attractors of sequences coding $β$-integers
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912683205328896 |
|---|---|
| author | Dvořáková, Lubomíra Moravcová, Martina |
| author_facet | Dvořáková, Lubomíra Moravcová, Martina |
| contents | In this paper, we describe minimal string attractors of prefixes of simple Parry sequences. These sequences form a coding of distances between consecutive $β$-integers in numeration systems with a real base $β$. Simple Parry sequences have been recently studied from this point of view and attractors of prefixes have been described. However, the authors themselves had doubts about their minimality and conjectured that attractors of alphabet size should be sufficient. We confirm their conjecture. Moreover, we provide attractors of prefixes of some particular form of binary non-simple Parry sequences. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_00650 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Attractors of sequences coding $β$-integers Dvořáková, Lubomíra Moravcová, Martina Combinatorics 68R15 In this paper, we describe minimal string attractors of prefixes of simple Parry sequences. These sequences form a coding of distances between consecutive $β$-integers in numeration systems with a real base $β$. Simple Parry sequences have been recently studied from this point of view and attractors of prefixes have been described. However, the authors themselves had doubts about their minimality and conjectured that attractors of alphabet size should be sufficient. We confirm their conjecture. Moreover, we provide attractors of prefixes of some particular form of binary non-simple Parry sequences. |
| title | Attractors of sequences coding $β$-integers |
| topic | Combinatorics 68R15 |
| url | https://arxiv.org/abs/2511.00650 |