<p>Given a smooth closed embedded self-shrinker <i>S</i> with index <i>I</i> in <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="205_2025_2125_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="20" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {R}^{n}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mi>n</mi> </msup> </math></EquationSource> </InlineEquation>, we construct an <i>I</i>-dimensional family of complete translators polynomially asymptotic to <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="205_2025_2125_Article_IEq2.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(S\times \mathbb {R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mo>×</mo> <mi mathvariant="double-struck">R</mi> </mrow> </math></EquationSource> </InlineEquation> at infinity, which answers a long-standing question by Ilmanen. We further prove that <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="205_2025_2125_Article_IEq3.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="34" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {R}^{n+1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mi mathvariant="double-struck">R</mi> </mrow> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> </math></EquationSource> </InlineEquation> can be decomposed in many ways into a one-parameter family of closed sets <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="205_2025_2125_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="60" /> </InlineMediaObject> <EquationSource Format="TEX">\(\coprod _{a\in \mathbb {R}} T_a\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mo>∐</mo> <mrow> <mi>a</mi> <mo>∈</mo> <mi mathvariant="double-struck">R</mi> </mrow> </msub> <msub> <mi>T</mi> <mi>a</mi> </msub> </mrow> </math></EquationSource> </InlineEquation>, and each closed set <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="205_2025_2125_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(T_a\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>T</mi> <mi>a</mi> </msub> </math></EquationSource> </InlineEquation> contains a complete translator asymptotic to <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="205_2025_2125_Article_IEq2.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(S\times \mathbb {R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mo>×</mo> <mi mathvariant="double-struck">R</mi> </mrow> </math></EquationSource> </InlineEquation> at infinity. If the closed set <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="205_2025_2125_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(T_a\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>T</mi> <mi>a</mi> </msub> </math></EquationSource> </InlineEquation> fattens, namely it has nonempty interior, then there are at least two translators asymptotic to each other at an exponential rate, which can be viewed as a kind of nonuniqueness. We show that this fattening phenomenon is non-generic but indeed happens.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On Mean Curvature Flow Translators with Prescribed Ends

  • Ao Sun,
  • Zhihan Wang

摘要

Given a smooth closed embedded self-shrinker S with index I in \(\mathbb {R}^{n}\) R n , we construct an I-dimensional family of complete translators polynomially asymptotic to \(S\times \mathbb {R}\) S × R at infinity, which answers a long-standing question by Ilmanen. We further prove that \(\mathbb {R}^{n+1}\) R n + 1 can be decomposed in many ways into a one-parameter family of closed sets \(\coprod _{a\in \mathbb {R}} T_a\) a R T a , and each closed set \(T_a\) T a contains a complete translator asymptotic to \(S\times \mathbb {R}\) S × R at infinity. If the closed set \(T_a\) T a fattens, namely it has nonempty interior, then there are at least two translators asymptotic to each other at an exponential rate, which can be viewed as a kind of nonuniqueness. We show that this fattening phenomenon is non-generic but indeed happens.