Department of Mathematics and Statistics: Recent submissions
Now showing items 61-73 of 73
-
A Ternary Square-free Sequence Avoiding Factors Equivalent to abcacba
(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 ... -
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. -
Avoidability index for binary patterns with reversal
(The Electronic Journal of Combinatorics, 2016-02-19)For every pattern p over the alphabet {x, x^R, y, y^R}, we specify the least k such that p is k-avoidable. -
Prediction of the Moisture Content of Eastern Canadian Corn using Measurements of Capacitance and Test Weight
(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 ... -
Mathematical Concepts and Proofs from Nicole Oresme: Using the History of Calculus to Teach Mathematics
(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 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 ... -
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 ... -
Constructing Regular Self-complementary Uniform Hypergraphs
(Journal of Combinatorial Designs, 2011-02-17)In this paper, we examine the possible orders of t-subset-regular self-complementary k-uniform hypergraphs, which form examples of large sets of two isomorphic t-designs. We reformulate Khosrovshahi and Tayfeh-Rezaie's ... -
Vertex-transitive self-complementary uniform hypergraphs of prime order
(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) ... -
Generating self-complementary uniform hypergraphs
(Discrete Mathematics, 2010-02)In 2007, Szymanski and Wojda proved that for positive integers n; k with k less than n, a self-complementary k-uniform hypergraph of order n exists if and only if n/k is even. In this paper, we characterize the cycle type ... -
Cyclically t-complementary uniform hypergraphs
(European Journal of Combinatorics, 2010-05)A cyclically t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation 2 Sym.V/ such that the sets E; E ; E 2; : : : ; E t1 partition the set of all ... -
Self-Complementary Hypergraphs
(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 ... -
Regular Two-Graphs and Equiangular Lines
(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 ...