Large context problems (LCP) are useful in teaching the history of science. In this article we consider the brachistochrone problem in a context stretching from Euclid through the Bernoullis. We highlight a variety of ...

Given an infinite word x over an alphabet A, a letter b occurring in x, and a total order \sigma on A, we call the smallest word with respect to \sigma starting with b in the shift orbit closure of x an extremal word of ...

We show that binary circular words of length n avoiding 7/3+ powers exist for every sufficiently large n. This is not the case for binary circular words avoiding k+ powers with k < 7/3

Canadian teachers (N = 1626) took part in a longitudinal, national survey conducted at two points early in the COVID-19 pandemic. Results indicated that teacher efficacy, attitudes toward change, and perceptions of ...

Burnout in teachers has been broadly investigated, but no studies have investigated burnout in teachers during a pandemic. The current study is based on a survey of 1278 Canadian teachers and examined whether the Job ...

In previous work, Currie and Rampersad showed that the growth of the number of binary words avoiding the pattern xxxR was intermediate between polynomial and exponential. We now show that the same result holds for the ...

We classify all 3 letter patterns that are avoidable in the abelian sense. A short list of four letter patterns for which abelian avoidance is undecided is given. Using a generalization of Zimin words we deduce some ...

We answer a question of Harju: For every n ≥ 3 there is a square-free ternary word of length n with a square-free self-shuffle.

We show that Dejean’s conjecture holds for n ≥ 27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible.