Let \(\left\{X_{n}\right\}_{n=0}^{\infty}\) be a sequence of i.i.d. Bernoulli random variables (i.e., \(X_{n}\) takes values \(\{0,1\}\) with probability \(\frac{1}{2}\) each), let \(X=\sum_{n=0}^{\infty} \rho^{n} X_{n}\), and let \(\mu\) be the corresponding probability measure. Erdös-Salem proved
✦ LIBER ✦
Families of Spectral Sets for Bernoulli Convolutions
✍ Scribed by Palle E. T. Jorgensen; Keri A. Kornelson; Karen L. Shuman
- Publisher
- SP Birkhäuser Verlag Boston
- Year
- 2010
- Tongue
- English
- Weight
- 581 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1069-5869
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Dimension of a Family of Singular Bernou
✍
K.S. Lau
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 705 KB
Upper bounds for p-divisibility of sets
✍
Stephen V Ullom
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 197 KB
A measure of thickness for families of s
✍
Antonín Le<anovsky; Vlastimil Pták
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 620 KB
On minimal Gerschgorin sets for families
✍
Richard S. Varga; Bernard W. Levinger
📂
Article
📅
1973
🏛
Springer-Verlag
🌐
English
⚖ 221 KB
Characterization problems for graphs, pa
✍
William T. Trotter Jr.; John I. Moore Jr.
📂
Article
📅
1976
🏛
Elsevier Science
🌐
English
⚖ 909 KB
A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum list of forbidden substructures, for example, Kuratowski's well known characterization of planar graphs. In this paper, we establish connections between characterization p
A Sperner-type theorem for families of f
✍
P. Frankl
📂
Article
📅
1978
🏛
Springer Netherlands
🌐
English
⚖ 413 KB