×
Caughran, James G.; Schwartz, Howard J.

Spectra of compact composition operators. (English) Zbl 0309.47003

Proc. Am. Math. Soc. 51, 127-130 (1975).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0309.47003

Cited in 3 Reviews
Cited in 16 Documents

MSC:

47A10 Spectrum, resolvent
30D55 \(H^p\)-classes (MSC2000)
46E15 Banach spaces of continuous, differentiable or analytic functions
47B06 Riesz operators; eigenvalue distributions; approximation numbers, \(s\)-numbers, Kolmogorov numbers, entropy numbers, etc. of operators
PDF BibTeX XML Cite
\textit{J. G. Caughran} and \textit{H. J. Schwartz}, Proc. Am. Math. Soc. 51, 127--130 (1975; Zbl 0309.47003)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] James G. Caughran, Polynomial approximation and spectral properties of composition operators on \?², Indiana Univ. Math. J. 21 (1971/1972), 81 – 84. · Zbl 0224.30054
[2] M. A. Denjoy, Sur l’iteration des fonctions analytiques, C. R. Acad. Sci. Paris 182 (1926), 255-257. · JFM 52.0309.04
[3] Peter L. Duren, Theory of \?^{\?} spaces, Pure and Applied Mathematics, Vol. 38, Academic Press, New York-London, 1970.
[4] M. Koenig, Recherches sur les intégrals de certaines équations fonctionnelles, Ann. Sci. École Norm. Sup. 3 (1884), 1-112.
[5] Eric A. Nordgren, Composition operators, Canad. J. Math. 20 (1968), 442 – 449. · Zbl 0161.34703
[6] John V. Ryff, Subordinate \?^{\?} functions, Duke Math. J. 33 (1966), 347 – 354. · Zbl 0148.30205
[7] J. H. Shapiro and P. D. Taylor, Compact, nuclear, and Hilbert-Schmidt composition operators on \?², Indiana Univ. Math. J. 23 (1973/74), 471 – 496. · Zbl 0276.47037
[8] J. Wolff, Sur l’iteration des fonctions..., C. R. Acad. Sci. Paris 182 (1926), 42-43, 200-201. · JFM 52.0309.02
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.