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

We prove that for any group of the cohomological dimension $n$ the $n$th power of the Berstein class of the group is nontrivial. This allows to prove the following Berstein-Svarc theorem for all $n$: Theorem. For a connected complex $X$…

Counting independent sets in graphs and hypergraphs under a variety of restrictions is a classical question with a long history. It is the subject of the celebrated container method which found numerous spectacular applications over the…

A chain of quantum subgroups of the quantum automorphism group of finite graphs has been introduced. It generalizes the construction of J. Bichon (see [3]) in a sense. A better bound of the non zero eigenvalues of the graph Laplacian has…

A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of…

Let $G$ be a graph with adjacency matrix $A(G)$. We conjecture that \[2n^+(G) \le n^-(G)(n^-(G) + 1),\] where $n^+(G)$ and $n^-(G)$ denote the number of positive and negative eigenvalues of $A(G)$, respectively. This conjecture generalizes…

We prove distance bounds for graphs possessing positive Bakry-\'Emery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits…

We investigate splitting-type variational problems with some linear growth conditions. For balanced solutions of the associated Euler-Lagrange equation we receive a result analogous to Bernstein's theorem on non-parametric minimal surfaces.…

In this expository article we revisit the Bernstein problem for several geometric PDEs including the minimal surface, Monge-Amp\`{e}re, and special Lagrangian equations. We also discuss the minimal surface system where appropriate. The…

Moser's Bernstein theorem \cite{moser61} says that an entire minimal graph of codimension 1 with bounded slope must be a hyperplane. An analogous result for arbitrary codimension is not true, by an example of Lawson-Osserman. Here, we show…

Let $ \Omega \subsetneq \mathbf{R}^n\,(n\geq 2)$ be an unbounded convex domain. We study the minimal surface equation in $\Omega$ with boundary value given by the sum of a linear function and a bounded uniformly continuous function in $…

The purpose of this paper is to prove some results on the absence of bound states for certain nonlinear Schr\"odinger equations on noncompact metric graphs with localized nonlinearity. In particular, we show how the topological and metric…

We reduce a strong version of the twist conjecture for Artin groups to Artin groups whose defining graphs have no separating vertices. This produces new examples of Artin groups satisfying the conjecture, and sheds more light on the…

End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…

We prove an extension of the Furstenberg set theorem to families of graphs satisfying a transversality condition. We apply the result to derive bounds on $L^{p}$-norms of Fourier transforms of fractal measures supported on plane curves.

This paper addresses the problem of constructing bearing rigid networks in arbitrary dimensions. We first show that the bearing rigidity of a network is a generic property that is critically determined by the underlying graph of the…

We show that, in gauge theory of principal connections, any gauge non-invariant Lagrangian can be completed to the BRST-invariant one. The BRST extension of the global Chern-Simons Lagrangian is present.

We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalises a theorem of Robertson and Seymour, which says that a minor-closed class of graphs has bounded…

We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…

We investigate the impact of a high-degree vertex in Tur\'{a}n problems for degenerate hypergraphs (including graphs). We say an $r$-graph $F$ is bounded if there exist constants $\alpha, \beta>0$ such that for large $n$, every $n$-vertex…

Given an unbalanced open quantum graph, we derive a formula relating sums over its scattering resonances with integrals outside a strip. We deduce lower bounds on the number of resonances (in bounded regions of the complex plane),that are…