English
Related papers

Related papers: A Bernstein theorem for two-valued minimal graphs …

200 papers

Let $G$ be a graph, and let $u$, $v$, and $w$ be vertices of $G$. If the distance between $u$ and $w$ does not equal the distance between $v$ and $w$, then $w$ is said to resolve $u$ and $v$. The metric dimension of $G$, denoted $\beta(G)$,…

Combinatorics · Mathematics 2020-02-26 Lucas Mol , Matthew J. H. Murphy , Ortrud R. Oellermann

A theorem of Gr\"unbaum, which states that every $m$-polytope is a refinement of an $m$-simplex, implies the following generalization of Tverberg's theorem: if $f$ is a linear function from an $m$-dimensional polytope $P$ to $\mathbb{R}^d$…

Combinatorics · Mathematics 2024-10-04 Pablo Soberón , Shira Zerbib

In this paper, we investigate properties of set-valued mappings that establish connection between the values of this map at two arbitrary points of the domain and the value at their midpoint. Such properties are, for instance, Jensen…

Classical Analysis and ODEs · Mathematics 2017-06-29 Carlos González , Kazimierz Nikodem , Zsolt Páles , Gari Roa

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$…

Algebraic Topology · Mathematics 2009-11-13 Alexander N. Dranishnikov , Yuli B. Rudyak

Let $X$ be an arbitrary smooth hypersurface in $\mathbb{C} \mathbb{P}^n$ of degree $d$. We prove the de Jong-Debarre Conjecture for $n \geq 2d-4$: the space of lines in $X$ has dimension $2n-d-3$. We also prove an analogous result for…

Algebraic Geometry · Mathematics 2020-10-15 Roya Beheshti , Eric Riedl

In this paper, we prove two Liouville-type theorems for capillary minimal graph over $\mathbb{R}^n_+$. First, if $u$ has linear growth, then for $n=2,3$ and for any $\theta\in(0,\pi)$, or $n\geq4$ and $\theta\in(\frac{\pi}6,\frac{5\pi}6)$,…

Differential Geometry · Mathematics 2026-02-11 Guofang Wang , Wei Wei , Xuwen Zhang

In this paper we study surfaces in Euclidean 3-space that satisfy a Weingarten condition of linear type as $\kappa_1=m \kappa_2 +n$, where $m$ and $n$ are real numbers and $\kappa_1$ and $\kappa_2$ denote the principal curvatures at each…

Differential Geometry · Mathematics 2007-06-13 Rafael López

A well known generalisation of Dirac's theorem states that if a graph $G$ on $n\ge 4k$ vertices has minimum degree at least $n/2$ then $G$ contains a $2$-factor consisting of exactly $k$ cycles. This is easily seen to be tight in terms of…

Combinatorics · Mathematics 2020-03-10 Matija Bucić , Erik Jahn , Alexey Pokrovskiy , Benny Sudakov

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

Combinatorics · Mathematics 2016-07-26 Jordan Almeter , Samet Demircan , Andrew Kallmeyer , Kevin G. Milans , Robert Winslow

Three variational vector equations are derived for the extended particle-field object located on the light cone. Point sources are excluded from the pure field equations and all physical magnitudes are free from divergences. Accepting 3D…

General Relativity and Quantum Cosmology · Physics 2008-02-03 I E Bulyzhenkov

We introduce a topological invariant, it a type of a graph-manifold, which takes natural values. For a 4-dimensional graph-manifold, whose type does not exceed two, it is proved that its universal cover is bi-Lipschitz equivalent to a…

Geometric Topology · Mathematics 2017-11-27 Aleksandr Smirnov

We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a consequence, we show that every edge in a cyclically…

Combinatorics · Mathematics 2022-10-19 Ajit Diwan

The paper discovers the family of identically-derived Euclidean one-parameter even-dimensional differential linear operators with unique eigenproperties, which prove to be inherently related to the emergent characterizations of fundamental…

Differential Geometry · Mathematics 2019-07-23 Dmitry Zhigalov

We study decomposition into simple arcs (i. e., arcs without self-intersections) for diagrams of knots and spatial graphs. In this paper, it is proved in particular that if no edge of a finite spatial graph $G$ is a knotted loop, then there…

Geometric Topology · Mathematics 2026-03-26 Yury Belousov , Andrei Malyutin

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…

Analysis of PDEs · Mathematics 2023-09-27 Connor Mooney , Yang Yang

Laurent Hauswirth and Harold Rosenberg developed the theory of minimal surfaces with finite total curvature in $\H^2\times\R$. They showed that the total curvature of one such a surface must be a non-negative integer multiple of $-2\pi$.…

Differential Geometry · Mathematics 2012-10-04 Juncheol Pyo , Magdalena Rodriguez

In this paper, we consider minimal graphs in the three-dimensional Riemannian manifold $M\times\mathbb{R}$. We mainly estimate the Gaussian curvature of such surfaces. We consider the minimal disks and minimal graphs bounded by two Jordan…

Differential Geometry · Mathematics 2022-07-12 David Kalaj

We show that the emerging field of discrete differential geometry can be usefully brought to bear on crystallization problems. In particular, we give a simplified proof of the Heitmann-Radin crystallization theorem (R. C. Heitmann, C.…

Differential Geometry · Mathematics 2017-08-02 Lucia De Luca , Gero Friesecke

The van der Waerden's theorem reads that an equilateral pentagon in Euclidean 3-space $\Bbb E^3$ with all diagonals of the same length is necessarily planar and its vertex set coincides with the vertex set of some convex regular pentagon.…

Metric Geometry · Mathematics 2016-05-12 Victor Alexandrov

The 2-blowup of a graph is obtained by replacing each vertex with two non-adjacent copies; a graph is biplanar if it is the union of two planar graphs. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar:…

Combinatorics · Mathematics 2024-10-29 David Eppstein
‹ Prev 1 8 9 10 Next ›