Related papers: Constructing entire minimal graphs by evolving pla…

We introduce a new family of closed differential forms naturally associated with minimal graphical submanifolds in Euclidean space, defined in arbitrary codimension. For each minimal graph, we construct an explicit closed form whose…

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…

Generalizing the Cauchy-Riemann equations, we construct the Osserman system of the first order for a pair $\left(f(x, y), g(x,y) \right)$ of two ${\mathbb{R}}$-valued functions on the domain $\Omega \subset {\mathbb{R}}^{2}$. The graph…

Rigid frameworks in some Euclidian space are embedded graphs having a unique local realization (up to Euclidian motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings…

Moser's Bernstein theorem \cite{moser61} says that an entire minimal graph of codimension 1 with bounded slope must be a hyperplane. An analogous result for arbitrary codimension is not true, by an example of Lawson-Osserman. Here, we show…

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…

We extend Osserman's lemma on the generalized Gauss map of two-dimensional minimal graphs of higher codimension, construct a Jenkins-Serrin type special Lagrangian Scherk graph explicitly, and generalize Calabi's correspondence between…

In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

This paper presents a complete classification of minimal graph surfaces that admit graphical transformations into other minimal surfaces. These transformations are functions that map the height function of a minimal graph surface to another…

We study minimum degree conditions for which a graph with given odd girth has a simple structure. For example, the classical work of Andr\'asfai, Erd\H os, and S\'os implies that every $n$-vertex graph with odd girth $2k+1$ and minimum…

We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…

We prove some epsilon regularity results for n-dimensional minimal two-valued Lipschitz graphs. The main theorems imply uniqueness of tangent cones and regularity of the singular set in a neighbourhood of any point at which at least one…

We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We characterize the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove…

In this article we develop a new way of systematically constructing infinitely many families of smooth subvarieties $X$ of any given dimension $m$, $m \geq 3$, and any given codimension in $\mathbb P^N$, embedded by complete subcanonical…

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

We construct harmonic diffeomorphisms from the complex plane $C$ onto any Hadamard surface $M$ whose curvature is bounded above by a negative constant. For that, we prove a Jenkins-Serrin type theorem for minimal graphs in $M\times R$ over…

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

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…

We construct a parabolic entire minimal graph $S$ over a finite topology complete Riemannian surface $\Sigma$ of curvature $-1$ and infinite area (thus of non-parabolic conformal type). The vertical projection of this graph yields a…