4 problems

Let $F_n$ be an even Fibonacci number, where the Fibonacci numbers satisfy the usual recurrence, and let $\mathbf{f}$ denote the Fibonacci word. A $k$-antipower is a concatenation…

A morphic word $w$ is an infinite word generated by iterating a morphism; an antipower is a word formed by concatenating pairwise distinct blocks of equal length. Berger–Defant's c…

Growth conjecture. There exists a sequence $(a_i)$ converging to $0$ such that, whenever $n$ lies between $3\cdot 2^i$ and $2^{i+1}(1-a_i)$,

Defant's conjecture.