Related papers: The anisotropic Bernstein problem

Already in $\bf{R}^4$, there are many known examples of minimal hypersurfaces, yet few structural results. We show that minimal submanifolds, of any dimension, that are confined in space are very restricted. It is well-known that the…

The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…

We consider exact solutions of Einstein equations defining static black holes parametrized by off-diagonal metrics which by anholonomic mappings can be equivalently transformed into some diagonal metrics with coefficients being very similar…

Lawson and Osserman proved that the Dirichlet problem for the minimal surface system is not always solvable in the class of Lipschitz maps. However, it is known that minimizing sequences (for area) of Lipschitz graphs converge to objects…

For $0\leq H< 1/2$, we construct entire $H$-graphs in $\mathbb{H}^2\times\mathbb{R}$ that are parabolic and not invariant by one parameter groups of isometries of $\mathbb{H}^2\times\mathbb{R}$. Their asymptotic boundaries are…

We describe a new class of groups of Burnside type, giving a procedure transforming an arbitrary non-free minimal action of the dihedral group on a Cantor set into an orbit-equivalent action of an infinite finitely generated periodic group.…

We extend Smale's singular bridge principle [Ann. of Math. 130 (1989), 603-642] for $n$-dimensional strictly stable minimal cones in $\mathbb{R}^{n+1}$ $(n \geq 7$) to arbitrary codimension and each $n \geq 3$. We then apply the procedure…

The transversal hypergraph problem is the task of enumerating the minimal hitting sets of a hypergraph. It is a long-standing open question whether this can be done in output-polynomial time. For hypergraphs whose solutions have bounded…

We propose a novel benchmarking methodology for graph neural networks (GNNs) based on the graph alignment problem, a combinatorial optimization task that generalizes graph isomorphism by aligning two unlabeled graphs to maximize overlapping…

We prove the existence of nontrivial closed surfaces with constant anisotropic mean curvature with respect to elliptic integrands in closed smooth $3$-dimensional Riemannian manifolds. The constructed min-max surfaces are smooth with at…

Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for…

A set of locally finite perimeter $E \subset \mathbb{R}^{n}$ is called an anisotropic minimal surface in an open set $A$ if $\Phi(E;A) \le \Phi(F;A)$ for some surface energy $\Phi(E;A) = \int_{\partial^{*}E \cap A} \| \nu_{E}\| d…

We prove a flatness result for entire nonlocal minimal graphs having some partial derivatives bounded from either above or below. This result generalizes fractional versions of classical theorems due to Bernstein and Moser. Our arguments…

Let $n,k,b$ be integers with $1 \le k-1 \le b \le n$ and let $G_{n,k,b}$ be the graph whose vertices are the $k$-element subsets $X$ of $\{0,\dots,n\}$ with $\max(X)-\min(X) \le b$ and where two such vertices $X,Y$ are joined by an edge if…

In this paper, we obtain an Ecker-Huisken type result for entire graphs with parallel mean curvature.

We provide new general methods in the calculus of variations for the anisotropic Plateau problem in arbitrary dimension and codimension. A new direct proof of Almgren's 1968 existence result is presented; namely, we produce from a class of…

We obtain a Bernstein theorem for special Lagrangian graphs in n-dimensional complex space for arbitrary n only assuming bounded slope, but no quantitative restriction.

We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…

We consider the minimization problem of an anisotropic energy in classes of $d$-rectifiable varifolds in $\mathbb R^n$, closed under Lipschitz deformations and encoding a suitable notion of boundary. We prove that any minimizing sequence…

A central theme in extremal combinatorics is the study of the maximum number of edges in an $r$-uniform hypergraph ($r$-graph) with matching number at most $s$ (the Erd\H{o}s Matching Conjecture) or with pairwise intersection at least $t$…