Coin tossing and sum sets

Journal of the Australian Mathematical Society

Gavin Brown¹ 

[1] John H. Williamson

关键词: primary 60 B 15;    secondary 43 A 05;   

DOI  :  10.1017/S1446788700029347

学科分类：数学（综合）

来源: Cambridge University Press

【 摘 要 】

We consider the distribution μ of numbers whose binary digits are generated from infinitely many tosses of a biased coin. It is shown that, if E has positive μ measure, then some n-fold sum of E with itself must contain an interval. This contrasts with the known result that all convolution powers of μ are singular.

【 授权许可】

Unknown