skip to main content


Title: Bi-Halfspace and Convex Hull Theorems for Translating Solitons
Abstract

While it is well known from examples that no interesting “halfspace theorem” holds for properly immersed $n$-dimensional self-translating mean curvature flow solitons in Euclidean space $\mathbb{R}^{n+1}$, we show that they must all obey a general “bi-halfspace theorem” (aka “wedge theorem”): two transverse vertical halfspaces can never contain the same such hypersurface. The same holds for any infinite end. The proofs avoid the typical methods of nonlinear barrier construction for the approach via distance functions and the Omori–Yau maximum principle. As an application we classify the closed convex hulls of all properly immersed (possibly with compact boundary) $n$-dimensional mean curvature flow self-translating solitons $\Sigma ^n$ in ${\mathbb{R}}^{n+1}$ up to an orthogonal projection in the direction of translation. This list is short, coinciding with the one given by Hoffman–Meeks in 1989 for minimal submanifolds: all of ${\mathbb{R}}^{n}$, halfspaces, slabs, hyperplanes, and convex compacts in ${\mathbb{R}}^{n}$.

 
more » « less
NSF-PAR ID:
10124704
Author(s) / Creator(s):
 ;  
Publisher / Repository:
Oxford University Press
Date Published:
Journal Name:
International Mathematics Research Notices
ISSN:
1073-7928
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    The skew mean curvature flow is an evolution equation for a $d$ dimensional manifold immersed into $\mathbb {R}^{d+2}$, and which moves along the binormal direction with a speed proportional to its mean curvature. In this article, we prove small data global regularity in low-regularity Sobolev spaces for the skew mean curvature flow in dimensions $d\geq 4$. This extends the local well-posedness result in [7].

     
    more » « less
  2. Abstract

    We show that the energy conditions are not necessary for boundedness of Riesz transforms in dimension $n\geq 2$. In dimension $n=1$, we construct an elliptic singular integral operator $H_{\flat } $ for which the energy conditions are not necessary for boundedness of $H_{\flat }$. The convolution kernel $K_{\flat }\left ( x\right ) $ of the operator $H_{\flat }$ is a smooth flattened version of the Hilbert transform kernel $K\left ( x\right ) =\frac{1}{x}$ that satisfies ellipticity $ \vert K_{\flat }\left ( x\right ) \vert \gtrsim \frac{1}{\left \vert x\right \vert }$, but not gradient ellipticity $ \vert K_{\flat }^{\prime }\left ( x\right ) \vert \gtrsim \frac{1}{ \vert x \vert ^{2}}$. Indeed the kernel has flat spots where $K_{\flat }^{\prime }\left ( x\right ) =0$ on a family of intervals, but $K_{\flat }^{\prime }\left ( x\right ) $ is otherwise negative on $\mathbb{R}\setminus \left \{ 0\right \} $. On the other hand, if a one-dimensional kernel $K\left ( x,y\right ) $ is both elliptic and gradient elliptic, then the energy conditions are necessary, and so by our theorem in [30], the $T1$ theorem holds for such kernels on the line. This paper includes results from arXiv:16079.06071v3 and arXiv:1801.03706v2.

     
    more » « less
  3. Abstract We prove an inequality that unifies previous works of the authors on the properties of the Radon transform on convex bodies including an extension of the Busemann–Petty problem and a slicing inequality for arbitrary functions. Let $K$ and $L$ be star bodies in ${\mathbb R}^n,$ let $0<k<n$ be an integer, and let $f,g$ be non-negative continuous functions on $K$ and $L$, respectively, so that $\|g\|_\infty =g(0)=1.$ Then $$\begin{align*} & \frac{\int_Kf}{\left(\int_L g\right)^{\frac{n-k}n}|K|^{\frac kn}} \le \frac n{n-k} \left(d_{\textrm{ovr}}(K,\mathcal{B}\mathcal{P}_k^n)\right)^k \max_{H} \frac{\int_{K\cap H} f}{\int_{L\cap H} g}, \end{align*}$$where $|K|$ stands for volume of proper dimension, $C$ is an absolute constant, the maximum is taken over all $(n-k)$-dimensional subspaces of ${\mathbb R}^n,$ and $d_{\textrm{ovr}}(K,\mathcal{B}\mathcal{P}_k^n)$ is the outer volume ratio distance from $K$ to the class of generalized $k$-intersection bodies in ${\mathbb R}^n.$ Another consequence of this result is a mean value inequality for the Radon transform. We also obtain a generalization of the isomorphic version of the Shephard problem. 
    more » « less
  4. Abstract

    Approximate integer programming is the following: For a given convex body$$K \subseteq {\mathbb {R}}^n$$KRn, either determine whether$$K \cap {\mathbb {Z}}^n$$KZnis empty, or find an integer point in the convex body$$2\cdot (K - c) +c$$2·(K-c)+cwhich isK, scaled by 2 from its center of gravityc. Approximate integer programming can be solved in time$$2^{O(n)}$$2O(n)while the fastest known methods for exact integer programming run in time$$2^{O(n)} \cdot n^n$$2O(n)·nn. So far, there are no efficient methods for integer programming known that are based on approximate integer programming. Our main contribution are two such methods, each yielding novel complexity results. First, we show that an integer point$$x^* \in (K \cap {\mathbb {Z}}^n)$$x(KZn)can be found in time$$2^{O(n)}$$2O(n), provided that theremaindersof each component$$x_i^* \mod \ell $$ximodfor some arbitrarily fixed$$\ell \ge 5(n+1)$$5(n+1)of$$x^*$$xare given. The algorithm is based on acutting-plane technique, iteratively halving the volume of the feasible set. The cutting planes are determined via approximate integer programming. Enumeration of the possible remainders gives a$$2^{O(n)}n^n$$2O(n)nnalgorithm for general integer programming. This matches the current best bound of an algorithm by Dadush (Integer programming, lattice algorithms, and deterministic, vol. Estimation. Georgia Institute of Technology, Atlanta, 2012) that is considerably more involved. Our algorithm also relies on a newasymmetric approximate Carathéodory theoremthat might be of interest on its own. Our second method concerns integer programming problems in equation-standard form$$Ax = b, 0 \le x \le u, \, x \in {\mathbb {Z}}^n$$Ax=b,0xu,xZn. Such a problem can be reduced to the solution of$$\prod _i O(\log u_i +1)$$iO(logui+1)approximate integer programming problems. This implies, for example thatknapsackorsubset-sumproblems withpolynomial variable range$$0 \le x_i \le p(n)$$0xip(n)can be solved in time$$(\log n)^{O(n)}$$(logn)O(n). For these problems, the best running time so far was$$n^n \cdot 2^{O(n)}$$nn·2O(n).

     
    more » « less
  5. Abstract

    The skew mean curvature flow is an evolution equation forddimensional manifolds embedded in$${{\mathbb {R}}}^{d+2}$$Rd+2(or more generally, in a Riemannian manifold). It can be viewed as a Schrödinger analogue of the mean curvature flow, or alternatively as a quasilinear version of the Schrödinger Map equation. In this article, we prove small data local well-posedness in low-regularity Sobolev spaces for the skew mean curvature flow in dimension$$d\ge 4$$d4.

     
    more » « less