相关论文: A Bernstein theorem for special Lagrangian graphs

We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…

A well-known theorem of Erd\H{o}s and Gallai asserts that a graph with no path of length $k$ contains at most $\frac{1}{2}(k-1)n$ edges. Recently Gy\H{o}ri, Katona and Lemons gave an extension of this result to hypergraphs by determining…

The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…

The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…

We introduce complex cones and associated projective gauges, generalizing a real Birkhoff cone and its Hilbert metric to complex vector spaces. We deduce a variety of spectral gap theorems in complex Banach spaces. We prove a dominated…

Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…

We prove a combination theorem for trees of (strongly) relatively hyperbolic spaces and finite graphs of (strongly) relatively hyperbolic groups. This gives a geometric extension of Bestvina and Feighn's Combination Theorem for hyperbolic…

The bandwidth theorem [Mathematische Annalen, 343(1):175--205, 2009] states that any $n$-vertex graph $G$ with minimum degree $\big(\tfrac{k-1}{k}+o(1)\big)n$ contains all $n$-vertex $k$-colourable graphs $H$ with bounded maximum degree and…

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 prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…

In this paper, we prove a new gradient estimate for minimal graphs defined on domains of a complete manifold with Ricci curvature bounded from below. In particular, we show that positive, entire minimal graphs on manifolds with non-negative…

Eberhard-type theorems are statements about the realizability of a polytope (or more general polyhedral maps) given the valency of its vertices and sizes of its polygonal faces up to a linear linear degree of freedom. We present new…

We study the problem of calculating noncommutative distances on graphs, using techniques from linear algebra, specifically, Birkhoff-James orthogonality. A complete characterization of the solutions is obtained in the case when the…

We prove a quantitative version of Oppenheim's conjecture for generic ternary indefinite quadratic forms. Our results are inspired by and analogous to recent results for diagonal quadratic forms due to Bourgain.

We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…

We generalize a result of Balister, Gy{\H{o}}ri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an $n$-vertex, $r$-uniform, connected, hypergraph with the maximum number of hyperedges, without a…

We obtain necessary conditions for the existence of complete vertical graphs of constant mean curvature in the Hyperbolic and Steady State spaces. In the two-dimensional case we prove Bernstein-type results in each of these ambient spaces.

Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…

A new Berry-Esseen bound for non-linear functionals of non-symmetric and non-homogeneous infinite Rademacher sequences is established. It is based on a discrete version of the Malliavin-Stein method and an analysis of the discrete…