Related papers: Constructing embedded surfaces for cellular embedd…

We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…

Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…

Neural implicit representations, which encode a surface as the level set of a neural network applied to spatial coordinates, have proven to be remarkably effective for optimizing, compressing, and generating 3D geometry. Although these…

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding $\varphi:G\rightarrow M$ of a graph $G$ into a 2-manifold $M$ maps the vertices in $V(G)$ to distinct points and the…

Theoretical results from discrete geometry suggest that normed spaces can abstractly embed finite metric spaces with surprisingly low theoretical bounds on distortion in low dimensions. In this paper, inspired by this theoretical insight,…

We prove that finite area isolated singularities of surfaces with constant positive curvature in R^3 are removable singularities, branch points or immersed conical singularities. We describe the space of immersed conical singularities of…

We construct examples of flat surfaces in $\mathbb{H}^3$ which are graphs over a two-punctured horosphere and classify complete embedded flat surfaces in $\mathbb{H}^3$ with only one end and at most two isolated singularities.

In algebraic topology, we usually represent surfaces by mean of cellular complexes. This representation is intrinsic, but requires to identify some points through an equivalence relation. On the other hand, embedding a surface in a…

We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…

For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian graph product, we call the factors of this product a…

Graph embedding is the major technique which is used to map guest graph into host graph. In architecture simulation, graph embedding is said to be one of the strongest application for the execution of parallel algorithm and simulation of…

We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a probability density…

In the Partially Embedded Planarity problem, we are given a graph $G$ together with a topological drawing of a subgraph $H$ of $G$. The task is to decide whether the drawing can be extended to a drawing of the whole graph such that no two…

Node embeddings map graph vertices into low-dimensional Euclidean spaces while preserving structural information. They are central to tasks such as node classification, link prediction, and signal reconstruction. A key goal is to design…

By a result of Orlov there always exists an embedding of the derived category of a finite-dimensional algebra of finite global dimension into the derived category of a high-dimensional smooth projective variety. In this article we give some…

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…

This paper is the third in a series where we describe the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. In [CM3]-[CM5] we describe the case where the surfaces are topologically disks on…

We investigate the structure of isometric subgraphs of hypercubes (i.e., partial cubes) which do not contain finite convex subgraphs contractible to the 3-cube minus one vertex $Q^-_3$ (here contraction means contracting the edges…

Motion planning is an important and well-studied field of robotics. A typical approach to finding a route is to construct a {\em cell graph} representing a scene and then to find a path in such a graph. In this paper we present and analyze…