Related papers: A Bernstein theorem for special Lagrangian graphs

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

The Bandwidth theorem of B\"ottcher, Schacht and Taraz gives a condition on the minimum degree of an $n$-vertex graph $G$ that ensures $G$ contains every $r$-chromatic graph $H$ on $n$ vertices of bounded degree and of bandwidth $o(n)$,…

We establish Bernstein-type theorems for entire constant mean curvature graphs in the three-dimensional light cone $\mathbb{Q}^3_+$ over the horosphere under the assumption that the Gaussian curvature $K$ is bounded below, by showing that…

We prove a Bernstein-type theorem for two-valued minimal graphs in the four-dimensional Euclidean space $\mathbf{R}^4$. This states that two-valued functions defined on the entire $\mathbf{R}^3$, and whose graph is a minimal surface, must…

It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all $\Delta\geq3$ and for all sufficiently large $n$, there is a simple $\Delta$-regular $n$-vertex graph with queue-number at…

We prove a substantial extension of an inverse spectral theorem of Ambarzumyan, and show that it can be applied to arbitrary compact Riemannian manifolds, compact quantum graphs and finite combinatorial graphs, subject to the imposition of…

We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…

The validity conditions for the extended Birkhoff theorem in multidimensional gravity with $n$ internal spaces are formulated, with no restriction on space-time dimensionality and signature. Examples of matter sources and geometries for…

We consider deformations of singular Lagrangian varieties in symplectic spaces. We show the coherence of the direct image sheaves of relative infinitesimal Lagrangian deformations. Using this result, we prove that, under some assumptions, a…

Several families of sharp Bernstein inequalities are established on the weighted $L^2$ space over parabolic domains, which include bounded or unbounded rotational paraboloids and parabolic surfaces. The main tool is a second-order…

We generalize the classical Blaschke Rolling Theorem to convex domains in Riemannian manifolds of bounded sectional curvature and arbitrary dimension. Our results are sharp and, in this sharp form, are new even in the model spaces of…

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…

In this paper, we prove Bernstein type theorems for entire convex graphical hypersurfaces with zero Gaussian curvature in both Euclidean and Minkowski context. A supplementary example illustrates that zero Gaussian convex spacelike…

We prove that an anisotropic minimal graph over a half-space with flat boundary must itself be flat. This generalizes a result of Edelen-Wang to the anisotropic case. The proof uses only the maximum principle and ideas from fully nonlinear…

We study the problem of finding a minimal graph with prescribed boundary data in arbitrary dimension and codimension. Existence, uniqueness, stability and regularity are treated. We first present the well-known results for codimension one:…

We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…

In this note, we prove that smooth self-shrinkers in $\Real^{n+1}$, that are entire graphs, are hyperplanes. Previously Ecker and Huisken showed that smooth self-shrinkers, that are entire graphs and have at most polynomial growth, are…

We prove Levinson's theorem for scattering on an (m+n)-vertex graph with n semi-infinite paths each attached to a different vertex, generalizing a previous result for the case n=1. This theorem counts the number of bound states in terms of…

We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.

Assuming that Brouwers Conjecture the upper bound for the sum of t< n largest eigenvalues of Laplacian graph on n vertices true for n <n_0, we prove the Brouwers Conjecture BC for n > n_0 for some fixed n_0