2011
DOI: 10.1090/s0002-9939-2010-10633-0
|View full text |Cite
|
Sign up to set email alerts
|

Discrete Bernoulli convolutions: An algorithmic approach toward bound improvement

Abstract: Abstract. In this paper we consider a discrete version of the Bernoulli convolution problem traditionally studied via functional analysis. We develop an algorithm which bounds the Bernoulli sequences, and we give a significant improvement on the best known bound.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…For the moment however, our results on piecewise convexity are restricted to some special values of λ, although we are able to run numerical approximations for any λ. There have been previous numerical investigations into Bernoulli convolutions, we mention in particular the work of Benjamini and Solomyak [1] and of Calkin et al [2,3].…”
Section: Introductionmentioning
confidence: 99%
“…For the moment however, our results on piecewise convexity are restricted to some special values of λ, although we are able to run numerical approximations for any λ. There have been previous numerical investigations into Bernoulli convolutions, we mention in particular the work of Benjamini and Solomyak [1] and of Calkin et al [2,3].…”
Section: Introductionmentioning
confidence: 99%