Hostname: page-component-848d4c4894-nr4z6 Total loading time: 0 Render date: 2024-04-30T13:46:38.790Z Has data issue: false hasContentIssue false

Clustering layers for the Fife—Greenlee problem in ℝn

Published online by Cambridge University Press:  22 October 2015

Zhuoran Du
Affiliation:
College of Mathematics and Econometrics, Hunan University, Changsha 410082, People’s Republic of China (duzr@hnu.edu.cn)
Juncheng Wei
Affiliation:
Department of Mathematics, University of British Columbia, Vancouver, BC V6T 1Z2, Canada (jcwei@math.ubc.ca)

Abstract

We consider the following Fife–Greenlee problem:

where Ω is a smooth and bounded domain in ℝn, ν is the outer unit normal to ∂Ω and a is a smooth function satisfying a(x) (–1, 1) in . Let K, Ω and Ω+ be the zero-level sets of a, {a < 0} and {a < 0}, respectively. We assume ∇a ≠ 0 on K. Fife and Greenlee constructed stable layer solutions, while del Pino et al. proved the existence of one unstable layer solution provided that some gap condition is satisfied. In this paper, for each odd integer m ≥ 3, we prove the existence of a sequence ε = εj → 0, and a solution with m-transition layers near K. The distance of any two layers is O(ε log(1/ε)). Furthermore, converges uniformly to ±1 on the compact sets of Ω± as j → +∞

Type
Research Article
Copyright
Copyright © Royal Society of Edinburgh 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)