Skip to main content
Article
Computable analysis and Blaschke products
Proceedings of the American Mathematical Society (2008)
  • Alec Matheson, Lamar University
  • Timothy H. McNicholl, Lamar University
Abstract
We show that if a Blaschke product defines a computable function, then it has a computable sequence of zeros in which the number of times each zero is repeated is its multiplicity. We then show that the converse is not true. We finally show that every computable, radial, interpolating sequence yields a computable Blaschke product.
Publication Date
2008
DOI
10.1090/S0002-9939-07-09102-2
Publisher Statement
First published in Proceedings of the American Mathematical Society 136 (2008), published by the American Mathematical Society.Copyright 2007 American Mathematical Society 
Citation Information
Alec Matheson and Timothy H. McNicholl. "Computable analysis and Blaschke products" Proceedings of the American Mathematical Society Vol. 136 Iss. 1 (2008) p. 321 - 332
Available at: http://works.bepress.com/timothy-mcnicholl/12/