Now showing items 11-20 of 83
There are Ternary Circular Square-Free Words of Length n for n ≥ 18
(The Electronic Journal of Combinatorics, 2002-10-11)
There are circular square-free words of length n on three symbols for n≥18. This proves a conjecture of R. J. Simpson.
Opportunity solving: Ordinary people doing extraordinary things, every day
(Canadian Education Network, 2020-10-16)
Counting endomorphisms of crown-like orders
The authors introduce the notion of crown-like orders and introduce powerful tools for counting the endomorphisms of orders of this type.
Square-free Words with Square-free Self-shuffles
(The Electronic Journal of Combinatorics, 2014-01-12)
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.
Canadian teachers' attitudes toward change, efficacy, and burnout during the COVID-19 pandemic
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 ...
The metric dimension and metric independence of a graph
(The Charles Babbage Research Centre, 2001)
A vertex x of a graph G resolves two vertices u and v of G if the distance from x to u does not equal the distance from x to v. A set S of vertices of G is a resolving set for G if every two distinct vertices of G are ...
Supporting Teachers in Times of Change: The Job Demands- Resources Model and Teacher Burnout During the COVID-19 Pandemic
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 ...
Binary Words Avoiding xxRx and Strongly Unimodal Sequences
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 ...
Regular Two-Graphs and Equiangular Lines
(University of Winnipeg, 2004)
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 ...
COVID-19’s Second Wave: How are teachers faring with the return to physical schools?
(Canadian Education Network, 2020-11-20)