中文
相关论文

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

200 篇论文

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

逻辑 · 数学 2025-07-14 Jana Maříková

Graded Lagrangian formalism in terms of a Grassmann-graded variational bicomplex on graded manifolds is developed in a very general setting. This formalism provides the comprehensive description of reducible degenerate Lagrangian systems,…

数学物理 · 物理学 2012-06-13 G. Sardanashvily

We establish a quantitative version of Oppenheim's conjecture for generic ternary indefinite quadratic forms using an analytic number theory approach. The statements come with power gains and in some cases are essentially optimal

数论 · 数学 2016-06-15 Jean Bourgain

Schmidt's subspace theorem in terms of Seshadri constants for closed subschemes in subgeneral position has been already developed sharply. We derive our theorem for numerically equivalent ample divisors by dint of the above theory step by…

数论 · 数学 2025-06-16 GuanHeng Zhao

We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.

组合数学 · 数学 2009-04-18 Gábor Elek , Gábor Lippner

We prove a sampling theorem for infinite-dimensional Paley-Wiener spaces on graphs which allows for stable frame reconstruction. We prove that all sampling sets for a fixed Paley-Wiener space are complements of lambda-sets (i.e. sets where…

泛函分析 · 数学 2026-05-29 Filippo Giannoni

In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…

量子物理 · 物理学 2020-05-26 Pavel Exner , Ondřej Turek

Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erd\H{o}s-Gallai Theorem in random graphs. In particular, we determine, up to a constant…

组合数学 · 数学 2020-01-15 József Balogh , Andrzej Dudek , Lina Li

The hypergraph jump problem and the study of Lagrangians of uniform hypergraphs are two classical areas of study in the extremal graph theory. In this paper, we refine the concept of jumps to strong jumps and consider the analogous problems…

组合数学 · 数学 2014-03-06 Travis Johnston , Linyuan Lu

A simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles. This leads to (i) direct proofs of the Krein conditions, and (ii) the characterization of strongly regular graphs…

组合数学 · 数学 2009-11-12 Norman Biggs

The topological Tverberg theorem claims that for any continuous map of the (q-1)(d+1)-simplex to R^d there are q disjoint faces such that their images have a non-empty intersection. This has been proved for affine maps, and if $q$ is a…

组合数学 · 数学 2008-02-25 Stephan Hell

Self-shrinkers are important geometric objects in the study of mean curvature flows, while the Bernstein Theorem is one of the most profound results in minimal surface theory. We prove a Bernstein type result for graphical self-shrinker…

微分几何 · 数学 2017-04-06 Hengyu Zhou

We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…

概率论 · 数学 2024-04-22 Anja Sturm , Moritz Wemheuer

We show that the notion of generalized Lenard chains naturally allows formulation of the theory of multi-separable and superintegrable systems in the context of bi-Hamiltonian geometry. We prove that the existence of generalized Lenard…

可精确求解与可积系统 · 物理学 2015-06-05 Piergiulio Tempesta , Giorgio Tondo

Let $(X,d)$ be a nonempty metric space and let $n\in \mathbb N^+$. We shall say that $T\colon X\to X$ is a graphic contraction of order $n$ if there exists $\alpha\in (0,1)$ such that the inequality $$ d(T^n x,T^{2n}x) \leqslant \alpha…

一般拓扑 · 数学 2026-05-25 Evgeniy Petrov

We present a rigorous proof of the convergence theorem for the Feynman graphs in arbitrary massive Euclidean quantum field theories on non-commutative R^d (NQFT). We give a detailed classification of divergent graphs in some massive NQFT…

高能物理 - 理论 · 物理学 2014-11-18 Iouri Chepelev , Radu Roiban

We construct nonlinear entire anisotropic minimal graphs over $\mathbb{R}^4$, completing the solution to the anisotropic Bernstein problem. The examples we construct have a variety of growth rates, and our approach both generalizes to…

偏微分方程分析 · 数学 2023-09-27 Connor Mooney , Yang Yang

In this paper, we prove a version of the arithmetic Bertini theorem asserting that there exists a strictly small and generically smooth section of a given arithmetically free graded arithmetic linear series.

代数几何 · 数学 2016-01-21 Hideaki Ikoma

We prove diameter bounds for graphs having positive Ricci-curvature bound in Bakry-Emery sense. One result using only curvature and maximal vertex degree is sharp in case of hypercubes. The other result depends on an additional dimension…

微分几何 · 数学 2019-04-03 Shiping Liu , Florentin Münch , Norbert Peyerimhoff

We summarize results concerning the Bernstein property of differential equations.

微分几何 · 数学 2019-01-29 Peter Lewintan