Related papers: The Nitsche--Hopf conjecture for minimal graphs

We present a proof of the generalized Nitsche's conjecture proposed by W.H.Meeks III and H. Rosenberg: For $t\ge 0$, let $P_t$ denote the horizontal plane of height $t$ over the $x_1,x_2$ plane. Suppose that $M \subset R^3$ is a minimal…

It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…

We investigate the Schur-complement curvature of D_N-equivariant folded exponential families on the simplex. Our main structural results are: (i) the curvature kappa_Schur(theta) is convex in the log-parameter theta = ln(q); (ii) it admits…

For a harmonic map $u:M^3\to S^1$ on a closed, oriented $3$--manifold, we establish the identity $$2\pi \int_{\theta\in S^1}\chi(\Sigma_{\theta})\geq \frac{1}{2}\int_{\theta\in S^1}\int_{\Sigma_{\theta}}(|du|^{-2}|Hess(u)|^2+R_M)$$ relating…

Using Seiberg-Witten theory, it is shown that any Kaehler metric of constant negative scalar curvature on a compact 4-manifold M minimizes the L^2-norm of scalar curvature among Riemannian metrics compatible with a fixed decomposition…

This work studies the convergence and finite sample approximations of entropic regularized Wasserstein distances in the Hilbert space setting. Our first main result is that for Gaussian measures on an infinite-dimensional Hilbert space,…

Building on work of Cai, F\"urer, and Immerman \cite{CFI92}, we show two hardness results for the Graph Isomorphism problem. First, we show that there are pairs of nonisomorphic $n$-vertex graphs $G$ and $H$ such that any sum-of-squares…

The Small Set Expansion Hypothesis (SSEH) is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose edge expansion is almost zero and one in which all small subsets of…

The Graph Pricing problem is among the fundamental problems whose approximability is not well-understood. While there is a simple combinatorial 1/4-approximation algorithm, the best hardness result remains at 1/2 assuming the Unique Games…

Let $B_2(p)$ be an $n$-dimensional smooth geodesic ball with Ricci curvature $\geq-(n-1)\kappa^2$ for some $\kappa\geq0$. We establish the Sobolev inequality and the uniform Neumann-Poincar\'e inequality on each minimal graph over $B_1(p)$…

A long-standing open question is which graph class is the most general one permitting constant-time constant-factor approximations for dominating sets. The approximation ratio has been bounded by increasingly general parameters such as…

Based on a calibration argument, we prove a Bernstein type theorem for entire minimal graphs over Gauss space $\mathbb{G}^n$ by a simple proof.

In this paper, we obtain an Ecker-Huisken type result for entire graphs with parallel mean curvature.

In 1951, H. Hopf proved that the only surfaces, homeomorphic to the sphere, with constant mean curvature in the Euclidean space are the round (geometrical) spheres. These results were generalized by S. S. Chern, and then by Eschenburg and…

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…

A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…

A graph of order $n$ is said to be \emph{$k$-factor-critical} ($0\leq k <n$) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not…

We prove the little Grothendieck theorem for any 2-convex noncommutative symmetric space. Let $\M$ be a von Neumann algebra equipped with a normal faithful semifinite trace $\t$, and let $E$ be an r.i. space on $(0, \8)$. Let $E(\M)$ be the…

A graph $G$ is $k$-critical if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. We give a lower bound, $f_k(n) \geq…

Let $M$ be a $C^{2}$-smooth Riemannian surface. A classical theorem in differential geometry states that the Gauss curvature function $K : M \to \mathbb{R}$ vanishes everywhere if and only if the surface is locally isometric to the…