# On the Ehrenfeucht-Mycielski Balance Conjecture

Abstract : 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.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [5 references]

https://hal.inria.fr/hal-01184790
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 17, 2015 - 4:59:54 PM
Last modification on : Saturday, February 27, 2021 - 4:02:05 PM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:17:33 PM

### File

dmAH0102.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01184790, version 1

### Citation

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. ⟨hal-01184790⟩

Record views