Search
Now showing items 11-20 of 73
Canadian teachers' attitudes toward change, efficacy, and burnout during the COVID-19 pandemic
(Elsevier, 2020-11-19)
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 Aveline's Hole 9 Cranium: A Partial Solution to a Long Standing Enigma
(University of Bristol Spelaeological Society, 2012)
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 ...
Avoidability index for binary patterns with reversal
(2017)
For every pattern p over the alphabet {x,x^R,y,y^R}, we specify the least k such that p is k-avoidable.
Shuffling and unshuffling
(Bulletin of the European Association for Theoretical Computer Science, 2012)
We consider various shuffling and unshuffling operations on languages and words, and examine their closure properties. Although the main goal is to provide some good and novel exercises and examples for undergraduate formal ...
The number of order–preserving maps of fences and crowns
(Springer, 1991-06)
We perform an exact enumeration of the order-preserving maps of fences (zig-zags) and crowns (cycles). From this we derive asymptotic results.
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 ...
Binary Words Avoiding xxRx and Strongly Unimodal Sequences
(2015-09-14)
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 ...
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 ...
Avoiding three consecutive blocks of the same size and same sum
(Association of Computing Machinery, 2014-04)
We show that there exists an infinite word over the alphabet {0,1,3,4} containing no three consecutive blocks of the same size and the same sum. This answers an open problem of Pirillo and Varricchio from1994.
There Exist Binary Circular 5/2+ Power Free Words of Every Length
(The Electronic Journal of Combinatorics, 2004-01-23)
We show that there exist binary circular 5/2+ power free words of every length.