Repetition-threshold formula for rich sequences

About 1 year old · traced to

Let Cd\mathcal{C}_d be the class of dd-ary sequences rich in palindromes. For each n∈Nn\in\mathbb{N}, let un\mathbf{u}_n denote the sequence defined in the paper by the corresponding morphism, and let E∗(un)E^*(\mathbf{u}_n) be its asymptotic critical exponent. Repetition-threshold formula. The repetition threshold is

RT(Cd)=E∗(u2d−1)\mathrm{RT}(\mathcal{C}_d)=E^*(\mathbf{u}_{2d-1})

for every d∈Nd\in\mathbb{N} with d≥2d\geq 2. This is presented as a suggestion based on estimates and examples, rather than as an established result; its resolution is not given in the supplied text.

References

Primary source

Lubomíra Dvořáková and Edita Pelantová, “The limit of repetition thresholds of rich sequences”, arXiv:2509.06104 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.