Ochem, Rampersad, and Shallit gave various examples of infinite words avoiding what they called approximate repetitions. An approximate repetition is a factor of the form x x', where x and x' are close to being identical. ...

This paper examines the mathematical work of the French bishop, Nicole Oresme (c. 1323–1382), and his contributions towards the development of the concept of graphing functions and approaches to investigating infinite ...

Regular two-graphs are antipodal distance-regular double coverings of the complete graph, and they have many interesting combinatorial properties. We derive a construction for regular two-graphs containing cliques of ...

We prove that the subsets of Nd that are S-recognizable for all abstract numeration systems S are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting.

For every pattern p over the alphabet {x,x^R,y,y^R}, we specify the least k such that p is k-avoidable.

Aveline's Hole is both one of the best-known sites with early human skeletal material in Britain and one of the most problematic in its history. First discovered and explored at the close of the 18th century, it yielded ...

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 ...

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.

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 ...