Related papers: Shortest path embeddings of graphs on surfaces
While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…
We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given…
In this article, we study geometric aspects of semi-arithmetic Riemann surfaces by means of number theory and hyperbolic geometry. First, we show the existence of infinitely many semi-arithmetic Riemann surfaces of various shapes and prove…
The \emph{genus} $\mathrm{g}(G)$ of a graph $G$ is the minimum $g$ such that $G$ has an embedding on the orientable surface $M_g$ of genus $g$. A drawing of a graph on a surface is \emph{independently even} if every pair of nonadjacent…
What is the shortest path between two data points lying in a high-dimensional space? While the answer is trivial in Euclidean geometry, it becomes significantly more complex when the data lies on a curved manifold -- requiring a Riemannian…
The results obtained in this paper grew from an attempt to generalize the main theorem of [1]. There it was shown that any circuit injection (a 1-1 onto edge map f such that if C is a circuit then f(C) is a circuit) from a 3-connected, not…
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…
Motivated by an old question of Gallai (1966) on the intersection of longest paths in a graph and the well-known conjectures of Lov\'{a}sz (1969) and Thomassen (1978) on the maximum length of paths and cycles in vertex-transitive graphs, we…
In this paper, we develop a general existence theory for properly embedded minimal surfaces with free boundary in any compact Riemannian 3-manifold $M$ with boundary $\partial M$. The main feature of our result is that no convexity…
We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…
We establish the lower bound of $4\pi(1+g)$ for the area of the Gauss map of any immersion of a closed oriented surface of genus $g$ into $\mathbb{S}^3$, taking values in the Grassmannian of $2$-planes in $\mathbb{R}^4$. This lower bound is…
E. Calabi and J. Cao showed that a closed geodesic of least length in a two-sphere with nonnegative curvature is always simple. Using min-max theory, we prove that for some higher dimensions, this result holds without assumptions on the…
Let $G$ be a graph embedded on a closed surface. We call $G$ a \emph{polyhedral embedding} if all facial walks are cycles, and any two of them are either disjoint or intersect in a single vertex or a single edge. In this paper, we present a…
A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…
The inductive biases of graph representation learning algorithms are often encoded in the background geometry of their embedding space. In this paper, we show that general directed graphs can be effectively represented by an embedding model…
This paper extends parts of the results from [P.W.Michor and D. Mumford, \emph{Appl. Comput. Harmon. Anal.,} 23 (2007), pp. 74--113] for plane curves to the case of hypersurfaces in $\mathbb R^n$. Let $M$ be a compact connected oriented…
Graph embedding is a transformation of nodes of a network into a set of vectors. A good embedding should capture the underlying graph topology and structure, node-to-node relationship, and other relevant information about the graph, its…
We study isometric embeddings of some solutions of the Einstein equations with suffciently high symmetries into a flat ambient space. We briefly describe a method for constructing surfaces with a given symmetry. We discuss all minimal…
We study the problem of construction of explicit isometric embeddings of (pseudo)-Riemannian manifolds. We discuss the method which is based in the idea that the exterior symmetry of the embedded surface and the interior symmetry of the…
We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…