The number of conformally equivalent maximal graphs
classification
🧮 math.DG
keywords
graphsnumbermaximalsingularitiesconformallyentireequivalentconstant
read the original abstract
We show that the number of entire maximal graphs with finitely many singular points that are conformally equivalent is a universal constant that depends only on the number of singularities, namely 2^$ for graphs with n+1 singularities. We also give an explicit description of the family of entire maximal graphs with a finite number of singularities all of them lying on a plane orthogonal to the limit normal vector at infinity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.