On the Ehrenfeucht-Mycielski Balance Conjecture - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

On the Ehrenfeucht-Mycielski Balance Conjecture


In 1992, A. Ehrenfeucht and J. Mycielski defined a seemingly pseudorandom binary sequence which has since been termed the EM-sequence. The balance conjecture for the EM-sequence, still open, is the conjecture that the sequence of EM-sequence initial segment averages converges to $1/2$. In this paper, we do not prove the balance conjecture but we do make some progress concerning it, namely, we prove that every limit point of the aforementioned sequence of averages lies in the interval $[1/4,3/4]$, improving the best previous result that every such limit point belongs to the interval $[0.11,0.89]$. Our approach is novel and exploits an analysis of the growth behavior as $n \to \infty$ of the rooted tree formed by the binary strings appearing at least twice as substrings of the length $n$ initial segment of the EM-sequence.
Fichier principal
Vignette du fichier
dmAH0102.pdf (181.49 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184790 , version 1 (17-08-2015)



John C. Kieffer, W. Szpankowski. On the Ehrenfeucht-Mycielski Balance Conjecture. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.19-30, ⟨10.46298/dmtcs.3542⟩. ⟨hal-01184790⟩


125 View
727 Download



Gmail Facebook X LinkedIn More