Related papers: A Bernstein theorem for two-valued minimal graphs …

Bernstein problem for affine maximal type equation has been a core problem in affine geometry. A conjecture proposed firstly by Chern for entire graph and then extended by Trudinger-Wang to its fully generality asserts that any Euclidean…

We give a new proof and a partial generalization of Jean Taylor's result [Ta] that says that Almgren almost-minimal sets of dimension 2 in $\R^3$ are locally $C^{1+\alpha}$-equivalent to minimal cones. The proof is rather elementary, but…

We prove that a stable minimal hypersurface of an open ball having a singular set of locally finite codimension 2 Hausdorff measure which is weakly close to a multiplicity 2 hyperplane is a 2-valued C^{1, alpha} graph in the interior.…

Previous studies have shown that supersymmetric partition function on $T^2 \times S^2$ is related to elliptic genus of two dimensional supersymmetric theory. In this short note we find a four dimensional supersymmetric theory, whose…

In this paper, we prove the following version of the famous Bernstein's theorem: Let $X\subset \mathbb R^{n+k}$ be a closed and connected set with Hausdorff dimension $n$. Assume that $X$ satisfies the monotonicity formula at $p\in X$.…

Twin-width is a recently introduced graph parameter based on the repeated contraction of near-twins. It has shown remarkable utility in algorithmic and structural graph theory, as well as in finite model theory -- particularly since…

In this paper, we show that any biharmonic simple rotational surface in the four-dimensional Euclidean space is minimal. The proof is based on reducing the biharmonic equation to a system of ordinary differential equations for the profile…

In this article we prove that for a large class of 2-dimensional minimal cones (including almost all 2-dimensional minimal cones that we know), the almost orthogonal union of any two of them is still a minimal cone. Comparing to existing…

The twin-width of a graph $G$ is the minimum integer $d$ such that $G$ has a $d$-contraction sequence, that is, a sequence of $|V(G)|-1$ iterated vertex identifications for which the overall maximum number of red edges incident to a single…

The Euclidean dimension a graph $G$ is defined to be the smallest integer $d$ such that the vertices of $G$ can be located in $\mathbb{R}^d$ in such a way that two vertices are unit distance apart if and only if they are adjacent in $G$. In…

A celebrated theorem of Stiebitz asserts that any graph with minimum degree at least $s+t+1$ can be partitioned into two parts which induce two subgraphs with minimum degree at least $s$ and $t$, respectively. This resolved a conjecture of…

In this article, we study the Lipschitz Geometry at infinity of complex analytic sets and we obtain results on algebraicity of analytic sets and on Bernstein's problem. Moser's Bernstein Theorem says that a minimal hypersurface which is a…

We prove a four dimensional version of the Bernstein Theorem, with complex polynomials being replaced by quaternionic polynomials. We deduce from the theorem a quaternionic Bernstein's inequality and give a formulation of this last result…

In this paper, we prove effective estimates for the number of exceptional values and the totally ramified value number for the Gauss map of pseudo-algebraic minimal surfaces in Euclidean four-space and give a kind of unicity theorem.

We develop a regularity and compactness theory for stable capillary minimal hypersurfaces in the half-space $\mathbb{H}^{n+1}$ with contact angle $\theta \in (0,\pi)$ and dimension $n \geq 2$. As a consequence, we obtain the generalized…

We provide proofs certifying that the structure theorem for vertex sets of bounded bidimensionality holds with polynomial bounds. The bidimensionality of vertex sets is a common generalisation of both treewidth and the face-cover-number of…

Erd\H{o}s, Harary, and Tutte defined the dimension of a graph $G$ as the smallest natural number $n$ such that $G$ can be embedded in $\mathbb{R}^n$ with each edge a straight line segment of length 1. Since the proposal of this definition,…

Bidirected graphs are a generalisation of directed graphs that arises in the study of undirected graphs with perfect matchings. Menger's famous theorem - the minimum size of a set separating two vertex sets $X$ and $Y$ is the same as the…

We study $p$-harmonic maps, $p$-harmonic morphisms, biharmonic maps, and quasiregular mappings into submanifolds of warped product Riemannian manifolds ${I}\times_f S^{m-1}(k)\, $ of an open interval and a complete simply-connecteded…

We set up a connection between the theory of spherical designs and the question of minima of Epstein's zeta function. More precisely, we prove that a Euclidean lattice, all layers of which hold a 4-design, achieves a local minimum of the…