Now showing items 1-10 of 20
(University of Ottawa, 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 ...
For each a > 2 there is an Infinite Binary Word with Critical Exponent a
(The Electronic Journal of Combinatorics, 2008-08-31)
The critical exponent of an infinite word w is the supremum of all rational numbers α such that w contains an α-power. We resolve an open question of Krieger and Shallit by showing that for each α>2 there is an infinite ...
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.
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.
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 ...
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 ...
The Brachistochrone Problem: Mathematics for a Broad Audience via a Large Context Problem
(Montana Council of Teachers of Mathematics & Information Age Publishing, 2008)
Large context problems (LCP) are useful in teaching the history of science. In this article we consider the brachistochrone problem in a context stretching from Euclid through the Bernoullis. We highlight a variety of ...
Attainable lengths for circular binary words avoiding k-powers
(The Belgian Mathematical Society, 2005)
We show that binary circular words of length n avoiding 7/3+ powers exist for every sufficiently large n. This is not the case for binary circular words avoiding k+ powers with k < 7/3
Mathematical Concepts and Proofs from Nicole Oresme: Using the History of Calculus to Teach Mathematics
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 ...
Sliding Down Inclines with Fixed Descent Time: a Converse to Galileo's Law of Chords
(Canadian Mathematical Society, 2008-12)