Related papers: A Bernstein theorem for special Lagrangian graphs

We generalize the unconstrained description of free massless higher spin fields previously developed in [Nucl.Phys. B 779 (2007) 155] to the case of free massive higher spin fields in a flat space of arbitrary dimension. The Lagrangian is…

A theorem of Wiegerinck asserts that the Bergman space of an open subset of the complex numbers is either infinite-dimensional or trivial. Recently, this has been generalized to holomorphic vector bundles over the projective line by the…

Calabi and Cheng-Yau's Bernstein-type theorem asserts that an entire zero mean curvature graph in Lorentz-Minkowski $(n+1)$-space $\boldsymbol R^{n+1}_1$ which admits only space-like points is a hyperplane. Recently, the third and fourth…

Let \Sigma be a complete minimal Lagrangian submanifold of \C^n. We identify regions in the Grassmannian of Lagrangian subspaces so that whenever the image of the Gauss map of \Sigma lies in one of these regions, then \Sigma is an affine…

We show that the Farrell-Jones Conjecture holds for fundamental groups of graphs of groups with abelian vertex groups. As a special case, this shows that the conjecture holds for generalized Baumslag-Solitar groups.

Assuming projective determinacy, we extend Spector's strong version of the Spector-Gandy Theorem to all odd levels of the projective hierarchy: Theorem. For every space $X$ which is a finite product of the natural numbers $N$ and Baire…

We use the Gromov-Witten invariants and a nonsqueezing theorem by the author to affirm a conjecture by P.Biran on the Lagrangian barriers.

It is shown that for any family of probability measures in Ornstein type constructions the corresponding transformation has almost surely a singular spectrum. This is a new generalization of Bourgain's theorem, the same result is proved for…

We prove a flatness result for entire nonlocal minimal graphs having some partial derivatives bounded from either above or below. This result generalizes fractional versions of classical theorems due to Bernstein and Moser. Our arguments…

The more then hundred years old Bernstein inequality states that the supremum norm of the derivative of a trigonometric polynomial of fixed degree can be bounded from above by supremum norm of the polynomial itself. The reversed Bernstein…

We present a quantum algorithm solving the $k$-distinctness problem in $O(n^{1-2^{k-2}/(2^k-1)})$ queries with a bounded error. This improves the previous $O(n^{k/(k+1)})$-query algorithm by Ambainis. The construction uses a modified…

Using probabilistic methods, we obtain grid-drawings of graphs without crossings with low volume and small aspect ratio. We show that every $D$-degenerate graph on $n$ vertices can be drawn in $[m]^3$ where $m^3 = O(D^2 n\log n)$. In…

We derive explicit, uniform, a priori interior Hessian and gradient estimates for special Lagrangian equations of all phases in dimension two.

We obtain an elementary invariance principle for multi-dimensional Brownian sheet where the underlying random fields are not necessarily independent or stationary. Possible applications include unit-root tests for spatial as well as panel…

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…

We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…

The Lagrangian of a hypergraph has been a useful tool in hypergraph extremal problems. In most applications, we need an upper bound for the Lagrangian of a hypergraph. Frankl and Furedi in \cite{FF} conjectured that the $r$-graph with $m$…

In the random geometric graph $G(n,r_n)$, $n$ vertices are placed randomly in Euclidean $d$-space and edges are added between any pair of vertices distant at most $r_n$ from each other. We establish strong laws of large numbers (LLNs) for a…

Starting with the large deviation principle (LDP) for the Erd\H{o}s-R\'enyi binomial random graph $\mathcal{G}(n,p)$ (edge indicators are i.i.d.), due to Chatterjee and Varadhan (2011), we derive the LDP for the uniform random graph…

We describe, in a very explicit way, a method for determining the spectra and bases of all the corresponding eigenspaces of arbitrary lifts of graphs (regular or not).