## Search

Now showing items 1-10 of 83

#### Teachers' Voices: Pandemic Lessons for the Future of Education

(University of Windsor, 2021-05-26)

In late 2019 and early 2020, governments around the world closed educational institutions due to the COVID-19 pandemic. A similar response occurred in Canada and resulted in a sudden pivot by teachers from classroom-based ...

#### Non-Repetitive Tilings

(The Electronic Journal of Combinatorics, 2002-07-03)

In 1906 Axel Thue showed how to construct an infinite non-repetitive (or square-free) word on an alphabet of size 3. Since then this result has been rediscovered many times and extended in many ways. We present a two-dimensional ...

#### Further applications of a power series method for pattern avoidance

(The Electronic Journal of Combinatorics, 2011-06-21)

In combinatorics on words, a word w over an alphabet ∑ is said to avoid a pattern
p over an alphabet ∆ if there is no factor x of w and no non-erasing morphism h
from ∆* to ∑* such that h(p) = x. Bell and Goh have recently ...

#### A chrono-geographic look at Mesolithic burials: an initial study

(Landesamt für Denkmalpflege und Archäologie Sachsen-Anhalt, 2016)

Over the past decade we have focused on two interrelated topics within Mesolithic burial studies, the relationship between burial number and burial date, and the chronology of Mesolithic sites with burials. Related to this ...

#### Suffix conjugates for a class of morphic subshifts

(Cambridge University Press, 2015-09)

Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and ...

#### Words with many palindrome pair factors

(The Electronic Journal of Combinatorics, 2015-10-30)

Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the property that for infinitely many n, every length-n factor is a product of two palindromes. We show that every Sturmian word ...

#### Cubefree words with many squares

(Discrete Mathematics and Theoretical Computer Science, 2014-05-13)

We construct infinite cubefree binary words containing exponentially many distinct squares of length n . We also show that for every positive integer n , there is a cubefree binary square of length 2n.

#### Overlap-Free Words and Generalizations

(University of Winnipeg, 2007)

The study of combinatorics on words dates back at least to the beginning of the
20th century and the work of Axel Thue. Thue was the first to give an example of an infinite word over a three letter alphabet that contains ...

#### Avoiding approximate repetitions with respect to the longest common subsequence distance

(Mathematical Sciences Publishers, 2015-09-17)

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

#### Attainable lengths for circular binary words avoiding k-powers

(The Belgian Mathematical Society, 2005)

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