Related papers: Simplicial embeddings between pants graphs
We construct new monomorphisms between mapping class groups of surfaces. The first family of examples injects the mapping class group of a closed surface into that of a different closed surface. The second family of examples are defined on…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In this paper, we present embeddings of rings, grids and…
We prove that any bounded degree regular graph with sufficiently strong spectral expansion contains an induced path of linear length. This is the first such result for expanders, strengthening an analogous result in the random setting by…
Let $S_{g,1,p}$ be an orientable surface of genus $g$ with one boundary component and $p$ punctures. Let $\mathcal{M}_{g,1,p}$ be the mapping-class group of $S_{g,1,p}$ relative to the boundary. We construct homomorphisms…
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…
We prove that any non-simply connected planar domain can be properly and minimally embedded in H^2 x R. The examples that we produce are vertical bi-graphs, and they are obtained from the conjugate surface of a Jenkins-Serrin graph.
Persistent homology (PH) has been widely applied to graph data to extract topological features. However, little attention has been paid to how different distance functions on a graph affect the resulting persistence barcodes and their…
We discuss some applications of an intrinsic multipication in the space of simple loops in a surface.
This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…
We show that many 3-manifold groups have no nonabelian surface subgroups. For example, any link of an isolated complex surface singularity has this property. In fact, we determine the exact class of closed graph-manifolds which have no…
Paths $P^1,\ldots,P^k$ in a graph $G=(V,E)$ are mutually induced if any two distinct $P^i$ and $P^j$ have neither common vertices nor adjacent vertices. For a fixed integer $k$, the $k$-Induced Disjoint Paths problem is to decide if a graph…
We propose shifted inner-product similarity (SIPS), which is a novel yet very simple extension of the ordinary inner-product similarity (IPS) for neural-network based graph embedding (GE). In contrast to IPS, that is limited to…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
A graph is intrinsically projectively linked (IPL) if its every embedding in projective space contains a nonsplit link. Some minor-minimal IPL graphs have been found previously. We determine that no minor-minimal IPL graphs on 16 edges…
In this paper we further develop the theory of $\alpha$-induction for nets of subfactors, in particular in view of the system of sectors obtained by mixing the two kinds of induction arising from the two choices of braiding. We construct a…
In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…
Analyzing embedded simplicial complexes, such as triangular meshes and graphs, is an important problem in many fields. We propose a new approach for analyzing embedded simplicial complexes in a subdivision-invariant and isometry-invariant…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
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…