The best bound of the area--length ratio in Ahlfors Covering surface theory (I)
Guang Yuan Zhang

TL;DR
This paper determines the exact optimal lower bound for the area--length ratio in Ahlfors' covering surface theory, establishing that the best constant is approximately 4.034, through explicit construction and analysis.
Contribution
It precisely calculates the maximal lower bound for the area--length ratio in Ahlfors' theory, improving understanding of extremal holomorphic mappings.
Findings
The best lower bound for the area--length ratio is approximately 4.034.
This bound is proven to be optimal via a sequence of mappings approaching it.
The exact value of the bound is given by a specific maximization formula.
Abstract
In Ahlfors' covering surface theory, it is well known that there exists a positive constant such that for any nonconstant holomorphic mapping if then% A(f,\Delta)\leq hL(f,\partial \Delta),% where is the disk in is the unit Riemann sphere, is the area of the image of and is the length of the image of , both counting multiplicities. In this paper, we will show that the best lower bound for is the number h_{0}=\max_{\tau \in \lbrack 0,1]}[ \frac{\sqrt{1+\tau ^{2}}(\pi +\arcsin \tau)}{\mathrm{{arccot}\frac{\sqrt{1-\tau ^{2}}}{\sqrt{% 1+\tau ^{2}}}}}-\tau ] =4. \allowbreak 034 159 790 \allowbreak 51..., % and this is the exact estimation, i.e. there exists a sequence of holomorphic mappings…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research
