Now showing items 21-30 of 83
Skeleton Cave, Leigh Woods, Bristol
(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 ...
Combinatorics and Algorithmics of Strings
(Dagstuhl Publishing, 2014-03-09)
Strings (aka sequences or words) form the most basic and natural data structure. They occur whenever information is electronically transmitted (as bit streams), when natural language text is spoken or written down (as words ...
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 ...
Extremal words in morphic subshifts
Given an infinite word x over an alphabet A, a letter b occurring in x, and a total order \sigma on A, we call the smallest word with respect to \sigma starting with b in the shift orbit closure of x an extremal word 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 ...
Avoiding approximate repetitions with respect to the longest common subsequence distance
(Mathematical Sciences Publishers, 2015-09-17)
Ochem, Rampersad, and Shallit gave various examples of infinite words avoiding what they called approximate repetitions. An approximate repetition is a factor of the form x x', where x and x' are close to being identical. ...
Sliding Down Inclines with Fixed Descent Time: a Converse to Galileo's Law of Chords
(Canadian Mathematical Society, 2008-12)
Unary patterns under permutations
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, ...
Dejean's conjecture holds for n ≥ 27
(EDP Sciences, 2009)
We show that Dejean’s conjecture holds for n ≥ 27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible.