Minimizers of a free boundary problem on three-dimensional cones

01/06/2021

∙

We consider a free boundary problem on three-dimensional cones depending on a parameter c and study when the free boundary is allowed to pass through the vertex of the cone. Combining analysis and computer-assisted proof, we show that when c is less than 4.3, the free boundary may pass through the vertex of the cone.

READ FULL TEXT

Minimizers of a free boundary problem on three-dimensional cones

A Crank-Nicolson type minimization scheme for a hyperbolic free boundary problem

Vertex-critical (P_3+ℓ P_1)-free and vertex-critical (gem, co-gem)-free graphs

Sequential Learning on Liver Tumor Boundary Semantics and Prognostic Biomarker Mining

A Shape-Newton Method for Free-boundary Problems Subject to The Bernoulli Boundary Condition

A refinement on the structure of vertex-critical (P_5, gem)-free graphs

Equivalent formulations of the oxygen depletion problem, other implicit free boundary value problems, and implications for numerical approximation

Seed-Point Based Geometric Partitioning of Nuclei Clumps

Minimizers of a free boundary problem on three-dimensional cones

Related Research

A Crank-Nicolson type minimization scheme for a hyperbolic free boundary problem

Vertex-critical (P_3+ℓ P_1)-free and vertex-critical (gem, co-gem)-free graphs

Sequential Learning on Liver Tumor Boundary Semantics and Prognostic Biomarker Mining

A Shape-Newton Method for Free-boundary Problems Subject to The Bernoulli Boundary Condition

A refinement on the structure of vertex-critical (P_5, gem)-free graphs

Equivalent formulations of the oxygen depletion problem, other implicit free boundary value problems, and implications for numerical approximation

Seed-Point Based Geometric Partitioning of Nuclei Clumps