2016
DOI: 10.1007/s11425-016-5135-4
|View full text |Cite
|
Sign up to set email alerts
|

Local solvability of the k-Hessian equations

Abstract: Abstract. In this work, we study the existence of local solutions in R n to k-Hessian equation, for which the nonhomogeneous term f is permitted to change the sign or be non negative; if f is C ∞ , so is the local solution. We also give a classification for the second order polynomial solutions to the k−Hessian equation, it is the basis to construct the local solutions and obtain the uniform ellipticity of the linearized operators at such constructed local solutions.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0
1

Year Published

2018
2018
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 30 publications
(44 reference statements)
0
4
0
1
Order By: Relevance
“…In this direction, Urbas [124,Theorem 3] proved global C 1 estimate. Tian, Wang and Wang [109] studied the local solvability of the k-Hessian equation in B r 0 for r 0 small. Maybe Theorem 4.1 can be applied to study the local solvability.…”
Section: K-hessian Equationsmentioning
confidence: 99%
“…In this direction, Urbas [124,Theorem 3] proved global C 1 estimate. Tian, Wang and Wang [109] studied the local solvability of the k-Hessian equation in B r 0 for r 0 small. Maybe Theorem 4.1 can be applied to study the local solvability.…”
Section: K-hessian Equationsmentioning
confidence: 99%
“…Remark that, in [20,21], we choose τ ∈ ∂Γ k (n) with σ k+1 (τ) < 0, so ϕ is not (k + 1)convex; also the solutions constructed in [3] must not be (k + 1)-convex, because in these cases every linearized operator (2.6) is uniformly elliptic. But in present work, we want to construct the local strictly convex solution, so we can't make that choice.…”
Section: Schema Of Construction Of Convex Local Solutionsmentioning
confidence: 99%
“…We also need to prove that the perturbation doesn't destruct the strictly convexity of ψ constructed by (2.7). Remark that the linearized equation is degenerate elliptic, so that there is a loss of the regularity for the à priori estimate of solution ρ m , but the coefficients of linearized operators depends on D 2 w m , so that we need to smoothing the solution ρ m to continue the iteration (2.8) for m ∈ N. This is quite different from the procedure of iteration used in [21] where the linearized equation is uniformly elliptic.…”
Section: ) Approximate Strictly Convex Solutionmentioning
confidence: 99%
See 1 more Smart Citation
“…在文献 [5,6] 中, 我们选取 τ ∈ ∂Γ k (n) 满足 σ k+1 (τ ) < 0, 在此条件下 φ 不是 (k + 1)-凸. 同时, 文 献 [10] 中构造的解也不可能是 (k + 1)-凸的, 这是因为在某种意义下 "非 (k + 1)-凸" 与 "线性化算子 的一致椭圆型" 是等价的.…”
Section: 构造齐次线性方程的解unclassified