Related papers: Constructing entire minimal graphs by evolving pla…

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…

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

We establish that every embedding of a Grassmann graph in a polar Grassmann graph can be reduced to an embedding in a Grassmann graph or to an embedding in the collinearity graph of a polar space. Also, we consider $3$-embeddings, i.e.…

Let ${\mathcal C}(\Omega)$ be the linear code arising from a projective system $\Omega$ of $\mathrm{PG}(V).$ Consider the point-line geometry $\Gamma=({\mathcal P},{\mathcal L})$ and a projective embedding $\varepsilon\colon…

We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…

It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar…

We show that there are minimal graphs in R^{n+1} whose intersection with the portion of the horizontal hyperplane contained in the unit ball has any prescribed geometry, up to a small deformation. The proof hinges on the construction of…

We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…

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…

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…

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…

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

We define affine growth diagrams consisting of $GL_m$ dominant weights that label the vertices of a staircase-shaped grid. These are also called cylindrical growth diagrams as defined by Speyer and White in the case of partitions. The…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

We construct new examples of immersed minimal surfaces with catenoid ends and finite total curvature, of both genus zero and higher genus. In the genus zero case, we classify all such surfaces with at most $2n+1$ ends, and with symmetry…

Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$,…

We study complete minimal graphs in HxR, which take asymptotic boundary values plus and minus infinity on alternating sides of an ideal inscribed polygon Γ in H. We give necessary and sufficient conditions on the "lenghts" of the sides…

We consider embeddings of planar graphs in $R^2$ where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar…

We consider minimal maps $f:M\to N$ between Riemannian manifolds $(M,\mathrm{g}_M)$ and $(N,\mathrm{g}_N)$, where $M$ is compact and where the sectional curvatures satisfy $\sec_N\le \sigma\le \sec_M$ for some $\sigma>0$. Under certain…