On repetition thresholds of caterpillars and trees of bounded degree

Under suitable boundary conditions and assuming a maximum principle for the interior points, we obtain a uniform convergence similar to that of Theorem 1.1.. Theorem 2.1 below can

[r]

This section is devoted to the study of the minimal number of limit repetitions over all Dejean words on a 5-letter alphabet. We claim without proof that it contains 360

This is a contradiction since the factor 01201 appearing in one occurrence of u would induce a forbidden factor 10210 in the word in W 3 corresponding to the opposite chain

We consider three types of Abelian-power-free languages (weak, semistrong and strong), corresponding to the three definitions of fractional Abelian powers.. When necessary, we add

The previous lemma dealt with repetitions of three-lettered factors, and it also gives the following corollary, which completes the study of three- and four-lettered factors in

The history of previous attempts to obtain a stronger result than Siegers is a curious chapter of accidents, and will be briefly summarised here before

Then U is factorial by Theorem 1, be- cause it is factorial if the points of Sing(R) impose independent linear conditions on homogeneous forms of degree 3r + d − 5 (see [8])...