Skip to main content
Article thumbnail
Location of Repository

DISCRETE BERNOULLI CONVOLUTIONS: AN ALGORITHMIC APPROACH TOWARD BOUND IMPROVEMENT

By Neil J. Calkin, Julia Davis, Michelle Delcourt, Zebediah Engberg, Jobby Jacob, Kevin James and Communicated Matthew A. Papanikolas

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. 1

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.3182
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ams.org/journals/pr... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.