Now showing items 39-58 of 73

    • Latent Profile Analysis of Manitoban Teachers' Burnout during the COVID-19 Pandemic 

      Sokal, Laura; Babb, Jeff; Eblie Trudel, Lesley (University of Winnipeg, 2021-03)
    • Least Periods of Factors of Infinite Words 

      Currie, James D.; Saari, Kalle (EDP Sciences, 2009)
      We show that any positive integer is the least period of a factor of the Thue-Morse word. We also characterize the set of least periods of factors of a Sturmian word. In particular, the corresponding set for the Fibonacci ...
    • Mathematical Concepts and Proofs from Nicole Oresme: Using the History of Calculus to Teach Mathematics 

      Babb, Jeff (2005)
      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 ...
    • The metric dimension and metric independence of a graph 

      Currie, James; Oellerman, Ortrud R. (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 ...
    • The minimal automaton recognizing mN in a linear numeration system 

      Charlier, Émilie; Rampersad, Narad; Rigo, Michel; Waxweiler, Laurent (Integers, 2011-12-02)
      We study the structure of automata accepting the greedy representations of N in a wide class of numeration systems. We describe the conditions under which such automata can have more than one strongly connected component ...
    • Multi-dimensional sets recognizable in all abstract numeration systems 

      Charlier, Émilie; Lacroix, Anne; Rampersad, Narad (EDP Sciences, 2011)
      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.
    • Non repetitive walks in graphs and digraphs 

      Currie, James Daniel (The University of CalgaryUniversity of Calgary, 1987-06)
      A word $w$ over alphabet $\Sigma$ is {\em non-repetitive} if we cannot write $w=abbc$, $a,b,c\in\Sigma^*$, $b\ne\epsilon$. That is, no subword of $w$ appears twice in a row in $w$. In 1906, Axel Thue, the Norwegian number ...
    • Non-Repetitive Tilings 

      Currie, James D.; Simpson, Jamie (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 ...
    • A Note on Antichains of Words 

      Currie, James D. (The Electronic Journal of Combinatorics, 1995-10-14)
      We can compress the word 'banana' as xyyz, where x= 'b', y= 'an',z= 'a'. We say that 'banana' encounters yy. Thus a 'coded' version of yy shows up in 'banana'. The relation 'u encounters w' is transitive, and thus generates ...
    • The number of order–preserving maps of fences and crowns 

      Currie, James; Visentin, Terry I. (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 Number of Ternary Words Avoiding Abelian Cubes Grows Exponentially 

      Currie, James; Rampersad, Narad; Aberkane, Ali (2004-06-19)
      We show that the number of ternary words of length n avoiding abelian cubes grows faster than r^n, where r = 2^{1/24}
    • On avoidability of formulas with reversal 

      Currie, James D.; Mol, Lucas; Rampersad, Narad (EDP Sciences, 2018-02-13)
      While a characterization of unavoidable formulas (without reversal) is well-known, little is known about the avoidability of formulas with reversal in general. In this article, we characterize the unavoidable formulas ...
    • Opportunity solving: Ordinary people doing extraordinary things, every day 

      Sokal, Laura; Eblie Trudel, Lesley; Babb, Jeff (Canadian Education Network, 2020-10-16)
    • Overlap-Free Words and Generalizations 

      Rampersad, Narad (University of WinnipegUniversity of Waterloo, 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 ...
    • Planning for Teacher Recovery from the COVID-19 Pandemic: Adaptive Regulation to Promote Resilience 

      Eblie Trudel, Lesley G.; Sokal, Laura J.; Babb, Jeff C. (Rivera Open, 2021-06-25)
      Increased job demands coupled with insufficient resources, typically result in job strain which can lead to burnout. However, in a series of studies conducted with Canadian teachers during the COVID-19 pandemic, the findings ...
    • Prediction of the Moisture Content of Eastern Canadian Corn using Measurements of Capacitance and Test Weight 

      Babb, J. C.; Dempster, C. J.; Wallis, R. J. (NRC Research Press, 1989-01)
      A statistical regression model for rapid prediction of moisture content based on measurements of dielectric capacitance and test weight was developed for Eastern Canadian corn (Zea mays L.). For 336 samples of the 1986 ...
    • 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 ...