Discover

Topics in Nevanlinna theory

Minsik readers
0.0
0 ratings
Other platforms
0.0
0 ratings
174
PAGES
~2h 54min
READING TIME
English
LANGUAGE
Springer-Verlag 3 views
ISBN
3540527850, 0387527850
3 views
Minsik want to read: 0
Minsik reading: 0
Minsik read: 0
Open Library want to read: 0
Open Library reading: 0
Open Library read: 0

About Author

Serge Lang

Algebra is a graduate-level textbook on abstract algebra written by Serge Lang and was originally published by Addison-Wesley in 1965. Its intended audience is students in graduate-level courses and readers who have previously attended undergraduate-level algebra courses.

Description

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.

Detailed Ratings

0.0Emotional Impact
No ratings yet
0.0Intellectual Depth
No ratings yet
0.0Writing Quality
No ratings yet
0.0Rereadability
No ratings yet
0.0Pacing
No ratings yet
0.0Readability
No ratings yet
0.0Plot Complexity
No ratings yet
0.0Humor
No ratings yet