Abstract
The main aim of the present paper is to give a simplified and easy-to-follow proof of the convexity estimates of level sets of minimal graphs. This proof greatly simplifies the original one in Wang and Zhang (2012) [36]. The innovation lies in that we find new curvature functions which are exactly supersolutions of the minimal surface equations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
