16 Apr
2007
16 Apr
'07
5:39 p.m.
Note that the Champernowne sequence A030190 has error 1/(log N). An explicit construction of Alon, Kohayakawa, Mauduit, Moreira and R\"odl allows one to achieve error 1/N^c for any exponent c greater than 2/3 (which beats what one would get from a random sequence of bits).
*Less than* 2/3?
Oops: right, less than 2/3. Jim
6794
Age (days ago)
6794
Last active (days ago)
0 comments
1 participants
participants (1)
-
James Propp