Meromorphic Functions on D(0,1). Generalized Schur Algorithm

M. J. Bertin, A. Decomps-Guilloux, M. Grandet-Hugot, M. Pathiaux-Delefosse and J. P. Schreiber
Additional contact information
M. J. Bertin: Université Pierre et Marie Curie Mathématiques
A. Decomps-Guilloux: Université Pierre et Marie Curie Mathématiques
M. Grandet-Hugot: Université de Caen Mathématiques
M. Pathiaux-Delefosse: Université Pierre et Marie Curie Mathématiques
J. P. Schreiber: Université d’Orléans, Château de la Source

Chapter Chapter 3 in Pisot and Salem Numbers, 1992, pp 27-60 from Springer

Abstract: Abstract At the beginning of this century, Schur showed by introducing an algorithm defined on C[[z]], that there exist necessary and sufficient conditions for an element of C[[z]] to be the Taylor series at zero of an analytic function bounded by 1 on D(0,1).

Keywords: Taylor Series; Meromorphic Function; Finite Rank; Preceding Lemma; Partial Matrix (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-8632-1_3

Ordering information: This item can be ordered from
http://www.springer.com/9783034886321

DOI: 10.1007/978-3-0348-8632-1_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().