Now showing items 55-73 of 73

    • Regular Two-Graphs and Equiangular Lines 

      Gosselin, Shonda (University of WinnipegUniversity of Waterloo, 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 ...
    • Self-Complementary Hypergraphs 

      Gosselin, Shonda (University of OttawaUniversity of Ottawa and Carleton University (joint program), 2009)
      In this thesis, we survey the current research into self-complementary hypergraphs, and present several new results. We characterize the cycle type of the permutations on n elements with order equal to a power of 2 which ...
    • Shuffling and unshuffling 

      Henshall, Dane; Rampersad, Narad; Shallit, Jeffrey (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 ...
    • Skeleton Cave, Leigh Woods, Bristol 

      Mullan, G. J.; Meiklejohn, C.; Babb, J. (University of Bristol Spelaeological Society, 2017)
      An account is given of the discovery and excavation of this small cave in the 1960s. It is recorded that archaeological finds were made, but of these, only a single human mandible can now be traced. Radiocarbon dating shows ...
    • Sliding Down Inclines with Fixed Descent Time: a Converse to Galileo's Law of Chords 

      Babb, Jeff (Canadian Mathematical Society, 2008-12)
    • Square-free Words with Square-free Self-shuffles 

      Currie, James D.; Saari, Kalle (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.
    • Squares and overlaps in the Thue-Morse sequence and some variants 

      Brown, Shandy; Rampersad, Narad; Shallit, Jeffrey; Vasiga, Troy (EDP Sciences, 2006)
      We consider the position and number of occurrences of squares in the Thue-Morse sequence, and show that the corresponding sequences are 2-regular. We also prove that changing any finite but nonzero number of bits in the ...
    • Suffix conjugates for a class of morphic subshifts 

      Currie, James D.; Rampersad, Narad; Saari, Kalle (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 ...
    • Supporting Teachers in Times of Change: The Job Demands- Resources Model and Teacher Burnout During the COVID-19 Pandemic 

      Sokal, Laura J.; Eblie Trudel, Lesley G.; Babb, Jeff C. (RedFame, 2020-10)
      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 ...
    • Teachers' Voices: Pandemic Lessons for the Future of Education 

      Eblie Trudel, Lesley G.; Sokal, Laura J.; Babb, Jeff C. (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 ...
    • A Ternary Square-free Sequence Avoiding Factors Equivalent to abcacba 

      Currie, James D. (The Electronic Journal of Combinatorics, 2016-05-27)
      We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding letter pattern xyzxzyx. In fact, we characterize ...
    • There are Ternary Circular Square-Free Words of Length n for n ≥ 18 

      Currie, James D. (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.
    • There Exist Binary Circular 5/2+ Power Free Words of Every Length 

      Aberkane, Ali; Currie, James D. (The Electronic Journal of Combinatorics, 2004-01-23)
      We show that there exist binary circular 5/2+ power free words of every length.
    • This is Us: Latent Profile Analysis of Canadian Teachers’ Burnout during the COVID-19 Pandemic 

      Babb, Jeff; Sokal, Laura; Eblie Trudel, Lesley (Canadian Society for the Study of Education, 2022)
      During the initial wave of the COVID-19 pandemic, 1,930 Canadian teachers were surveyed about their burnout and resilience levels, as well as their job demands and resources. Latent profile analysis revealed that teachers ...
    • Transformational Leadership Approaches and Their Influence on Teacher Resilience During the COVID-19 Pandemic 

      Eblie Trudel, Lesley; Sokal, Laura; Babb, Jeff (North American Business Press, 2022)
      With stress documented beyond inherent levels in our initial research with Canadian teachers during the COVID-19 pandemic, this case study moves beyond the consideration of individual strategies to reduce burnout, toward ...
    • Unary patterns under permutations 

      Currie, James D.; Nowotka, Dirk; Manea, Florin; Reshadi, Kamellia (Elsevier, 2018-06-04)
      Thue characterized completely the avoidability of unary patterns. Adding function variables gives a general setting capturing avoidance of powers, avoidance of patterns with palindromes, avoidance of powers under coding, ...
    • Vertex-transitive self-complementary uniform hypergraphs of prime order 

      Gosselin, Shonda (Discrete Mathematics, 2009-09)
      For an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a construction for vertex-transitive self-complementary k-uniform hypergraphs of order n for each integer n such that pn(p)≡1(mod2ℓ+1) ...
    • Words with many palindrome pair factors 

      Borchert, Adam; Rampersad, Narad (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 ...
    • Words without Near-Repetitions 

      Currie, J.; Bendor-Samuel, A. (Canadian Mathematical Society, 1992-06-01)
      We find an infinite word w on four symbols with the following property: Two occurrences of any block in w must be separated by more than the length of the block. That is, in any subword of w of the form xyx, the length of ...