2003
DOI: 10.1070/sm2003v194n07abeh000753
|View full text |Cite
|
Sign up to set email alerts
|

Description of the set of singular entire solutions of the maximal surface equation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2005
2005
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…Similar result in the Lorentzian setting can be founded in [11]. Also a different approach to an end by Klyachin can be founded in [13]. We omit the proof.…”
Section: Dg Dzmentioning
confidence: 61%
“…Similar result in the Lorentzian setting can be founded in [11]. Also a different approach to an end by Klyachin can be founded in [13]. We omit the proof.…”
Section: Dg Dzmentioning
confidence: 61%
“…The proof follows from some well known classic results by Osserman [18], Jorge and Meeks [9] and R. Schoen [22] for minimal surfaces. A different approach in the Lorentzian setting can be found in [10]. We omit the proof.…”
Section: Global Behavior Of Complete Embedded Maximal Surfaces With I...mentioning
confidence: 99%
“…Theorem 2.2 (Klyachin [10]) Let h(x) be a function defined on a compact set K ⊂ {x 3 = 0}, Int(K) = ∅, and satisfying the inequality |h(x) − h(y)| < |x − y| for all x, y ∈ K, x = y. Then, for every timelike vector v there exists a unique solution u ∈ C 2 (R 2 − K) ∩ C(R 2 ) to the maximal graph equation such that u| K = h and F ∞ = v, where as above F ∞ is the flux at the end.…”
Section: Existence and Uniqueness Of Cmf Graphs With Any Number Of Si...mentioning
confidence: 99%
See 2 more Smart Citations