27 search results - page 1 / 6 » An Analogue of the Thue-Morse Sequence |
COMBINATORICS
2007
13 years 4 months ago
2007
We consider the finite binary words Z(n), n ∈ N, defined by the following selfsimilar process: Z(0) := 0, Z(1) := 01, and Z(n + 1) := Z(n) · Z(n − 1), where the dot · deno...
DMTCS
2007
13 years 4 months ago
2007
We define a morphism based upon a Latin square that generalizes the Thue-Morse morphism. We prove that fixed points of this morphism are overlap-free sequences, generalizing resu...
DM
2008
13 years 4 months ago
2008
JCT
1998
13 years 4 months ago
1998
Recently, Andrews and Berkovich introduced a trinomial version of Bailey’s lemma. In this note we show that each ordinary Bailey pair gives rise to a trinomial Bailey pair. This ...
JCT
2010
13 years 3 months ago
2010
We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d+ 1 ≤ · · · ≤ d+ n and d− 1 ≤ · · · ...