English
Related papers

Related papers: A Bernstein theorem for special Lagrangian graphs

200 papers

We obtain a new differentiable sphere theorem for compact Lagrangian submanifolds in complex Euclidean space and complex projective space.

Differential Geometry · Mathematics 2011-09-08 Haizhong Li , Xianfeng Wang

We prove that the sensitivity of any non-trivial graph property on $n$ vertices is at least $\lfloor \frac{1}{2}n \rfloor$ , provided $n$ is sufficiently large.

Computational Complexity · Computer Science 2016-09-20 Ilan Karpas

We derive a Liouville type result for special Lagrangian equations with certain "convexity" and restricted linear growth assumptions on the solutions.

Analysis of PDEs · Mathematics 2008-01-08 Micah Warren , Yu Yuan

This survey describes some recent rigidity results obtained by the authors for the prescribed mean curvature problem on graphs $u : M \rightarrow \mathbb{R}$. Emphasis is put on minimal, CMC and capillary graphs, as well as on graphical…

Differential Geometry · Mathematics 2020-11-17 Bruno Bianchini , Giulio Colombo , Marco Magliaro , Luciano Mari , Patrizia Pucci , Marco Rigoli

Recently Wolff obtained a sharp $L^2$ bilinear restriction theorem for bounded subsets of the cone in general dimension. Here we adapt the argument of Wolff to also handle subsets of ``elliptic surfaces'' such as paraboloids and spheres.…

Classical Analysis and ODEs · Mathematics 2007-05-23 Terence Tao

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

Combinatorics · Mathematics 2017-03-06 Carlos Hoppen , Nicholas Wormald

In this paper, we present a sharp upper bound for the spectral radius of an $n$-vertex graph without $F$-minor for sufficient large $n$, where $F$ is obtained from the complete graph $K_r$ by deleting disjointed paths. Furthermore, the…

Combinatorics · Mathematics 2023-11-14 Ming-Zhu Chen , A-Ming Liu , Xiao-Dong Zhang

We give a simple proof of Bourgain's theorem on the singularity of Ornstein's maps.

Dynamical Systems · Mathematics 2015-09-01 El Houcein El Abdalaoui

For a graph $G$, denote by $t_r(G)$ (resp. $b_r(G)$) the maximum size of a $K_r$-free (resp. $(r-1)$-partite) subgraph of $G$. Of course $t_r(G) \geq b_r(G)$ for any $G$, and Tur\'an's Theorem says that equality holds for complete graphs.…

Probability · Mathematics 2015-01-08 Bobby DeMarco , Jeff Kahn

Let $M$ be an $n$-dimensional smooth oriented complete embedded minimal hypersurface in $\mathbb{R}^{n+1}$ with Euclidean volume growth. We show that if the image under the Gauss map of $M$ avoids some neighborhood of a half-equator, then…

Differential Geometry · Mathematics 2022-05-17 Qi Ding

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…

Combinatorics · Mathematics 2016-11-28 Agelos Georgakopoulos , Stephan Wagner

Let $(n^+, n^0, n^-)$ denote the inertia of a graph $G$ with $n$ vertices. Nordhaus-Gaddum bounds are known for inertia, except for an upper bound for $n^-$. We conjecture that for any graph \[ n^-(G) + n^-(\bar{G}) \le 1.5(n - 1), \] and…

Combinatorics · Mathematics 2019-03-05 Pawel Wocjan , Clive Elphick

It is proved that for infinitely many positive integers n, there exists a circulant graph of order n whose Weisfeiler-Leman dimension is at least c\sqrt{log n} for some positive constant c not depending on n.

Combinatorics · Mathematics 2025-12-16 Yulai Wu , Qing Ren , Ilia Ponomarenko

Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…

Probability · Mathematics 2020-11-25 Souvik Dhara , Subhabrata Sen

We give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily…

Functional Analysis · Mathematics 2020-10-01 Ognjen Milatovic

The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…

Combinatorics · Mathematics 2007-05-23 Y. Safarov

We define the notion of special Lagrangian curvature, showing how it may be interpreted as an alternative higher dimensional generalisation of two dimensional Gaussian curvature. We obtain first a local rigidity result for this curvature…

Differential Geometry · Mathematics 2008-07-16 Graham Smith

Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…

Combinatorics · Mathematics 2019-10-30 Gaiane Panina

We obtain a multidimensional Tauberian theorem for Laplace transforms of Gelfand-Shilov ultradistributions. The result is derived from a Laplace transform characterization of bounded sets in spaces of ultradistributions with supports in a…

Functional Analysis · Mathematics 2020-10-16 Lenny Neyt , Jasson Vindas

We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs…

Combinatorics · Mathematics 2019-08-19 Christian Borgs , Jennifer T. Chayes , Henry Cohn , Yufei Zhao