Topics in Nevanlinna Theory (Paperback, 1990 ed.)

These are notes of lectures on Nevanlinna theory, in the classical case of meromorphic functions, and the generalization by Carlson-Griffith to equidimensional holomorphic maps using as domain space finite coverings of C resp. Cn. Conjecturally best possible error terms are obtained following a method of Ahlfors and Wong. This is especially significant when obtaining uniformity for the error term w.r.t. coverings, since the analytic yields case a strong version of Vojta's conjectures in the number-theoretic case involving the theory of heights. The counting function for the ramified locus in the analytic case is the analogue of the normalized logarithmetic discriminant in the number-theoretic case, and is seen to occur with the expected coefficient 1. The error terms are given involving an approximating function (type function) similar to the probabilistic type function of Khitchine in number theory. The leisurely exposition allows readers with no background in Nevanlinna Theory to approach some of the basic remaining problems around the error term. It may be used as a continuation of a graduate course in complex analysis, also leading into complex differential geometry.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Lecture Notes in Mathematics, 1433
Release date:	July 1990
First published:	1990
Authors:	Serge Lang • William Cherry
Dimensions:	234 x 156 x 10mm (L x W x T)
Format:	Paperback
Pages:	180
Edition:	1990 ed.
ISBN-13:	978-3-540-52785-5
Categories:	Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Complex analysis Books > Science & Mathematics > Mathematics > Geometry > Differential & Riemannian geometry
LSN:	3-540-52785-0
Barcode:	9783540527855

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!