Related papers: A Bernstein theorem for special Lagrangian graphs

We give direct and inverse theorems for the weighted approximation of functions with inner singularities by combinations of Bernstein polynomials.

We formulate and prove a Gelfand-Levitan trace formula for general quantum graphs with arbitrary edge lengths and coupling conditions which cover all self-adjoint operators on quantum graphs, except for a set of measure zero. The formula is…

We consider entire solutions $u$ to the minimal surface equation in $R^N$, with $ N\ge8,$ and we prove the following sharp result : if $N-7$ partial derivatives $ \frac{\partial u }{\partial {x_j}}$ are bounded on one side (not necessarily…

Let $\Gamma$ be a metric graph having a linear system $g^r_{2r}$ for some $2 \leq r \leq g-2$ then $\Gamma$ has a linear system $g^1_2$. This is similar to the well-known Clifford's Theorem from the theory of linear systems on smooth…

By analogy with Weinstein's neighbourhood theorem, we prove a uniqueness result for symplectic neighbourhoods of a large family of stratified subspaces. This result generalizes existing constructions, e.g., in the search for exotic…

The Brouwer conjecture (BC) in spectral graph theory claims that the sum of the largest k Kirchhoff eigenvalues of a graph are bounded above by the number m of edges plus k(k+1)/2. We show that (BC) holds for all graphs with n vertices if n…

The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem…

We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero…

We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…

In this article we derive an explicit diameter bound for graphs satisfying the so-called curvature dimension conditions $CD(K,n)$. This refines a recent result due to Liu, M\"unch and Peyerimhoff when the dimension $n$ is finite.

In this article we present a generalization of a Leibniz's geometrical theorem and an application of it.

The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence…

We generalize the Hartogs triangle to a class of bounded Hartogs domains, and we prove that the corresponding Bergman projections are bounded on $L^p$ if and only if $p$ is in the range $(\frac{2n}{n+1},\frac{2n}{n-1})$.

In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this…

We prove a Stepanov differentiability type theorem for intrinsic graphs in sub-Riemannian Heisenberg groups.

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

Frames are the most natural generalization of orthonormal bases that allow the inclusion of redundant systems. In this article, we introduce the concept of frames generated by graphs in finite-dimensional spaces and study their properties.…

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…

In this paper, we can obtain curvature estimates for spacelike admissible graphic hypersurfaces in the $(n+1)$-dimensional Lorentz-Minkowski space $\mathbb{R}^{n+1}_{1}$, and through which the existence of spacelike admissible graphic…

We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…