Related papers: Invariant embeddings of unimodular random planar g…
It is shown that in dimension at least three a local diffeomorphism of Euclidean n-space into itself is injective provided that the pull-back of every plane is a Riemannian submanifold which is conformal to a plane. Using a similar…
A graph is $1$-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges…
Due to Janet-Cartan's theorem, any analytic Riemannian manifolds can be locally isometrically embedded into a sufficiently high dimensional Euclidean space. However, for an individual Riemannian manifold (M,g), it is in general hard to…
An Euclidean greedy embedding of a graph is a straight-line embedding in the plane, such that for every pair of vertices $s$ and $t$, the vertex $s$ has a neighbor $v$ with smaller distance to $t$ than $s$. This drawing style is motivated…
We prove that for every closed, connected, orientable, irreducible 3-manifold, there exists an alternating group A_n which is not the topological symmetry group of any graph embedded in the manifold. We also show that for every finite group…
The Smith embedding of a finite planar map with two marked vertices, possibly with conductances on the edges, is a way of representing the map as a tiling of a finite cylinder by rectangles. In this embedding, each edge of the planar map…
The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a…
Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t…
We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into Euclidean spaces. We distinguish two very different…
Splitting invariants describe how a plane curve "splits" by the pull-back under a Galois cover over the projective plane whose branch locus contains no component of the plane curve. They enable us to distinguish the embedded topology of…
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…
We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of…
We prove that every $2d$-regular unimodular random network carries an invariant random Schreier decoration. Equivalently, it is the Schreier coset graph of an invariant random subgroup of the free group $F_d$. As a corollary we get that…
End-periodic homotopy equivalences of infinite, locally finite graphs serve as dimension-one analogs of the end-periodic automorphisms traditionally defined on infinite-type surfaces. We demonstrate that if $\Gamma$ is an infinite graph…
A key technique of machine learning and computer vision is to embed discrete weighted graphs into continuous spaces for further downstream processing. Embedding discrete hierarchical structures in hyperbolic geometry has proven very…
In this work we prove the fact that, for a short time, it is possible to construct a smooth parametrized family of isometric embeddings of an arbitrary smooth parametrized family of Riemannian metrics on a smooth closed manifold into an…
Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…
Various classes of Graph Neural Networks (GNN) have been proposed and shown to be successful in a wide range of applications with graph structured data. In this paper, we propose a theoretical framework able to compare the expressive power…
Let G be a reductive algebraic group and H a closed subgroup of G. An affine embedding of the homogeneous space G/H is an affine G-variety with an open G-orbit isomorphic to G/H. We start with some basic properties of affine embeddings and…