Search
Now showing items 41-50 of 73
Least Periods of Factors of Infinite Words
(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 ...
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 ...
Avoidability index for binary patterns with reversal
(2017)
For every pattern p over the alphabet {x,x^R,y,y^R}, we specify the least k such that p is k-avoidable.
A direct proof of a result of Thue
(Utilitas Mathematica, 1984)
Extremal Infinite Overlap-Free Binary Words
(The Electronic Journal of Combinatorics, 1998-05-03)
Let t be the infinite fixed point, starting with 1, of the morphism μ:0→01, 1→10. An infinite word over {0,1} is said to be overlap-free if it contains no factor of the form axaxa, where a∈{0,1} and x∈{0,1}∗. We prove that ...
Avelines's Hole: An Unexpected Twist in the Tale
(University of Bristol Spelaeological Society, 2019)
Aveline’s Hole is the largest known Early Mesolithic cemetery in Britain, previously thought to have no evidence for subsequent burial activity. Thus, it came as some surprise when the results of a recent ancient human DNA ...
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 ...
It’s okay to be okay too. Why calling out teachers’ “toxic positivity” may backfire
(Canadian Education Network, 2020)
The minimal automaton recognizing mN in a linear numeration system
(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 ...
A Note on Antichains of Words
(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 ...