Normality of the Ehrenfeucht-Mycielski Sequence

10/03/2017
by   Kundan Krishna, et al.
0

We study the binary Ehrenfeucht Mycielski sequence seeking a balance between the number of occurrences of different binary strings. There have been numerous attempts to prove the balance conjecture of the sequence, which roughly states that 1 and 0 occur equally often in it. Our contribution is twofold. First, we study weaker forms of the conjecture proved in the past and lay out detailed proofs for many lemmas which were stated without proofs. Secondly, we extend the claim of balance to that of normality and prove a weaker form of simple normality to word length 2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/01/2021

A note on Barker sequences of even length

A Barker sequence is a binary sequence for which all nontrivial aperiodi...
research
10/21/2020

Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture

Recently Dekking conjectured the form of the subword complexity function...
research
01/27/2023

Proof of a conjecture of Krawchuk and Rampersad

We prove a 2018 conjecture of Krawchuk and Rampersad on the extremal beh...
research
04/30/2023

On Rueppel's Linear Complexity Conjecture

Rueppel's conjecture on the linear complexity of the first n terms of th...
research
07/14/2020

On a combinatorial generation problem of Knuth

The well-known middle levels conjecture asserts that for every integer n...
research
08/12/2023

Proving properties of some greedily-defined integer recurrences via automata theory

Venkatachala on the one hand, and Avdispahić Zejnulahi on the other,...
research
04/28/2022

Skolem Meets Schanuel

The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros o...

Please sign up or login with your details

Forgot password? Click here to reset