Related papers: Gaussian curvature conjecture for minimal graphs
A variant of the Gauss curvature flow for closed and convex hypersurfaces is considered. We reveal that if the initial hypersurface is pinched enough, then this property is preserved. Furthermore, based on some structure assumptions on the…
We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…
We consider surfaces immersed in three-dimensional pseudohermitian manifolds. We define the notion of (p-)mean curvature and of the associated (p-)minimal surfaces, extending some concepts previously given for the (flat) Heisenberg group.…
In 1982, Tuza conjectured that the size $\tau(G)$ of a minimum set of edges that intersects every triangle of a graph $G$ is at most twice the size $\nu(G)$ of a maximum set of edge-disjoint triangles of $G$. This conjecture was proved for…
Finding the diameter of a graph in general cannot be done in truly subquadratic assuming the Strong Exponential Time Hypothesis (SETH), even when the underlying graph is unweighted and sparse. When restricting to concrete classes of graphs…
The well known Chen's conjecture on biharmonic submanifolds states that a biharmonic submanifold in a Euclidean space is a minimal one ([10-13, 16, 18-21, 8]). For the case of hypersurfaces, we know that Chen's conjecture is true for…
We prove a discrete Gauss-Bonnet-Chern theorem which states where summing the curvature over all vertices of a finite graph G=(V,E) gives the Euler characteristic of G.
The geometry of minimal surfaces generated by charge 2 Bogomolny monopoles on 3-dimensional Euclidean space is described in terms of the moduli parameter k. We find that the distribution of Gaussian curvature on the surface reflects the…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…
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.
The purpose of this paper is to reveal the relationship between the total curvature and the global behavior of the Gauss map of a complete minimal Lagrangian surface in the complex two-space. To achieve this purpose, we show the precise…
We establish the following theorem of Bernstein type for the first Heisenberg group: Let S be a C^2 connected H-minimal surface which is a graph over some plane P, then S is either a non-characteristic vertical plane, or its generalized…
Without using the $L^2$ extension theorem, we provide a new proof of the equality part in Suita's conjecture, which states that for any open Riemann surface admitting a Green's function, the Bergman kernel and the logarithmic capacity…
We classify all surfaces with constant Gaussian curvature $K$ in Euclidean $3$-space that can be expressed as an implicit equation of type $f(x)+g(y)+h(z)=0$, where $f$, $g$ and $h$ are real functions of one variable. If $K=0$, we prove…
In the previous paper, Takahasi and the authors generalized the theory of minimal surfaces in Euclidean n-space to that of surfaces with holomorphic Gauss map in certain class of non-compact symmetric spaces. It also includes the theory of…
We investigate the structure of 3-dimensional complete minimal hypersurfaces in the unit sphere with Gauss-Kronecker curvature identically zero.
The maximal graph Dirichlet problem asks whether there exists a spacelike graph, in a semi-Euclidean space, with a given boundary and with mean curvature everywhere zero. We prove the existence of solutions to this problem under certain…
Ricci curvature was proposed by Ollivier in a general framework of metric measure spaces, and it has been studied extensively in the context of graphs in recent years. In this paper we prove upper bounds for Ollivier's Ricci curvature for…
The curvature regularities are well-known for providing strong priors in the continuity of edges, which have been applied to a wide range of applications in image processing and computer vision. However, these models are usually non-convex,…
We prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on surface-embedded graphs: the Shortest Cut Graph problem and the Multiway Cut…