Related papers: The anisotropic Bernstein problem

A matchstick graph is a graph drawn with straight edges in the plane such that the edges have unit length, and non-adjacent edges do not intersect. We call a matchstick graph $(m;n)$-regular if every vertex has only degree $m$ or $n$. In…

Let \Sigma be a minimal submanifold of \R^{n+m} that can be represented as the graph of a smooth map f:\R^n-->\R^m. We apply a formula we derived in the study of mean curvature flow to obtain conditions under which \Sigma must be an affine…

In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…

We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…

There are many complex combinatorial problems which involve searching for an undirected graph satisfying given constraints. Such problems are often highly challenging because of the large number of isomorphic representations of their…

In this paper we achieve a first concrete step towards a better understanding of the so-called Bernstein problem in higher dimensional Heisenberg groups. Indeed, in the sub-Riemannian Heisenberg group $\mathbb{H}^n$, with $n\geq 2$, we show…

We prove existence and uniqueness of solutions to a transport equation modelling vehicular traffic in which the velocity field depends non-locally on the downstream traffic density via a discontinuous anisotropic kernel. The result is…

The aim of this paper is investigating the existence of solutions of some semilinear elliptic problems on open bounded domains when the nonlinearity is subcritical and asymptotically linear at infinity and there is a perturbation term which…

We show that a wide range of overdetermined boundary problems for semilinear equations with position-dependent nonlinearities admits nontrivial solutions. The result holds true both on the Euclidean space and on compact Riemannian…

We consider the Minimum Steiner Cut problem on undirected planar graphs with non-negative edge weights. This problem involves finding the minimum cut of the graph that separates a specified subset $X$ of vertices (terminals) into two parts.…

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

In this paper, we introduce a functional and a geometric setting for an obstacle problem for nonlocal minimal graphs. In particular we study existence of solutions, a priori estimates, and we prove the equivalence of the two settings. We…

We consider a higher-order Henneberg-type minimal surfaces family using the generalized Weierstrass--Enneper representation in four-dimensional space $\mathbb{R}^4$. We derive explicit parametric equations for the surface and determine its…

We consider the numerical construction of minimal Lagrangian graphs, which is related to recent applications in materials science, molecular engineering, and theoretical physics. It is known that this problem can be formulated as an…

Lawson-Osserman constructed three types of non-parametric minimal cones of high codimensions based on Hopf maps between spheres, which correspond to Lipschitz but non-differentiable solutions to the minimal surface equations, thereby making…

A 1-plane graph is a graph together with a drawing in the plane in such a way that each edge is crossed at most once. A 1-plane graph is maximal if no edge can be added without violating either 1-planarity or simplicity. Let $m(n)$ denote…

Some classical graph problems such as finding minimal spanning tree, shortest path or maximal flow can be done efficiently. We describe slight variations of such problems which are shown to be NP-complete. Our proofs use straightforward…

A longstanding open question of Archdeacon and Craft asks whether every complete graph has a minimum genus embedding with at most one nontriangular face. We exhibit such an embedding for each complete graph except $K_8$, the complete graph…

We study the number of lines in hypergraphs in a more symmetric setting, where both the hypergraph and its complement are considered. In the general case and in some special cases, the lower bounds on the number of lines are much higher…

We consider minimal graphs u(x,y)>0 over unbounded domains D (with u vanishing on the boundary of D). Assuming D contains a sector properly containing a halfplane, we obtain estimates on growth and provide examples illustrating a range of…