English
Related papers

Related papers: Stable minimal graphs in Heisenberg group $\mathbb…

200 papers

We study the stability of $p$-area minimizing surfaces in the Heisenberg group under perturbations of the weight function and the drift vector field in generalized least gradient problems of the form \[ \inf_{w\in BV_0(\Omega)} \int_\Omega…

Analysis of PDEs · Mathematics 2026-05-26 Amir Moradifam , Gerardo Orozco-Fernandez

G is a Koenig-Egervary graph provided alpha(G)+ mu(G)=|V(G)|, where mu(G) is the size of a maximum matching and alpha(G) is the cardinality of a maximum stable set. S is a local maximum stable set of G if S is a maximum stable set of the…

Combinatorics · Mathematics 2011-01-25 Vadim E. Levit , Eugen Mandrescu

We give a new proof for the $C^\infty$ regularity of $C^2$ smooth conformal mappings of the sub-Riemannian Heisenberg group. Our proof avoids any use of nonlinear potential theory and relies only on hypoellipticity of H\"ormander operators…

Analysis of PDEs · Mathematics 2017-01-13 Alex D. Austin , Jeremy T. Tyson

We prove the removable singularity theorem for nonlocal minimal graphs. Specifically, we show that any nonlocal minimal graph in $\Omega \setminus K$, where $\Omega \subset \mathbb{R}^n$ is an open set and $K \subset \Omega$ is a compact…

Differential Geometry · Mathematics 2026-02-03 Minhyun Kim

It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…

Differential Geometry · Mathematics 2007-05-23 Mu-Tao Wang

For an arbitrary countable directed graph E we show that the only possible values of the stable rank of the associated Cuntz-Krieger algebra C*(E) are 1, 2 or \infty. Explicit criteria for each of these three cases are given. We…

Operator Algebras · Mathematics 2007-05-23 Klaus Deicke , Jeong Hee Hong , Wojciech Szymanski

We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors…

Probability · Mathematics 2017-12-12 Eric Ossami Endo , Daniel Valesin

We deal with the minimal Lagrangian surfaces of the Einstein-K\"ahler surface $S^2 \times S^2$, studying local geometric properties and showing that they can be locally described as Gauss maps of minimal surfaces in $S^3 \subset R^4$. We…

Differential Geometry · Mathematics 2012-12-04 Ildefonso Castro , Francisco Urbano

The main result of the present paper is a Rademacher-type theorem for intrinsic Lipschitz graphs of codimension $k\leq n$ in sub-Riemannian Heisenberg groups $\mathbb H^n$. For the purpose of proving such a result we settle several related…

Metric Geometry · Mathematics 2023-06-22 Davide Vittone

We show that in the first sub-Riemannian Heisenberg group there are intrinsic graphs of smooth functions that are both critical and stable points of the sub-Riemannian perimeter under compactly supported variations of contact…

Differential Geometry · Mathematics 2017-08-24 Sebastiano Golo

We show that every locally sparse graph contains a linearly sized expanding subgraph. For constants $c_1>c_2>1$, $0<\alpha<1$, a graph $G$ on $n$ vertices is called a $(c_1,c_2,\alpha)$-graph if it has at least $c_1n$ edges, but every…

Combinatorics · Mathematics 2017-05-04 Michael Krivelevich

We consider stabilities for the weighted length or energy functional of a discrete map from a finite weighted graph $(X,m_{E})$ into a smooth Riemannian manifold $(M,g)$. We prove the non-existence of a stable discrete minimal immersion or…

Differential Geometry · Mathematics 2023-06-27 Toru Kajigaya

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

Combinatorics · Mathematics 2020-01-15 James Davies , Carsten Thomassen

We establish an area formula for the spherical measure of intrinsic graphs of any codimension in homogeneous groups. Our approach relies on the assumption that the map defining the intrinsic graph is continuously intrinsically…

Metric Geometry · Mathematics 2026-03-19 Francesca Corni , Valentino Magnani

Recently, the author and Melentijevi\'c resolved the longstanding Gaussian curvature problem by proving the sharp inequality \[ |\mathcal{K}| < c_0 = \frac{\pi^2}{2} \] for minimal graphs over the unit disk, evaluated at the point of the…

Differential Geometry · Mathematics 2025-08-26 David Kalaj

In 2018, by Ramsey and Hoffman theory, Koolen, Yang, and Yang presented a structural result on graphs with smallest eigenvalue at least $-3$ and large minimum degree. In this study, we depart from the conventional use of Ramsey theory and…

Combinatorics · Mathematics 2025-12-23 Jack H. Koolen , Hong-Jun Ge , Chenhui Lv , Qianqian Yang

Let $\mathbb{E}$ be a connected and orientable Riemannian 3-manifold with a non-singular Killing vector field whose associated one-parameter group of the isometries of $\mathbb{E}$ acts freely and properly on $\E$. Then, there exists a…

Differential Geometry · Mathematics 2026-03-06 Andrea Del Prete

We present a characterization of minimal cones of class $C^2$ and $C^1$ in the first Heisenberg group $\mathbb{H}^1$, with an additional set of examples of minimal cones that are not of class $C^1$.

Metric Geometry · Mathematics 2021-02-01 Sebastiano Nicolussi Golo , Manuel Ritoré

For a graph $H$, let $$c_{\infty}(H)= \lim_{n \to \infty}\max\frac{|E(G)|}{n},$$ where the maximum is taken over all graphs $G$ on $n$ vertices not containing $H$ as a minor. Thus $c_{\infty}(H)$ is the asymptotic maximum density of graphs…

Combinatorics · Mathematics 2019-03-12 Rohan Kapadia , Sergey Norin , Yingjie Qian

A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…

Combinatorics · Mathematics 2021-01-05 Ken-ichi Kawarabayashi , Robin Thomas , Paul Wollan