English
Related papers

Related papers: Simplicial embeddings between pants graphs

200 papers

The random graph is an infinite graph with the universal property that any embedding of $G-v$ extends to an embedding of $G$, for any finite graph. In this paper we show that this graph embeds in the curve graph of a surface $\Sigma$ if and…

Geometric Topology · Mathematics 2016-12-20 Edgar A. Bering , Jonah Gaster

We introduce the concept of a pants decomposition for a finitely generated free group and construct the corresponding pants graph. A pants decomposition of a free group leads to the formation of a simplicial graph, referred to as the pants…

Group Theory · Mathematics 2026-04-20 Donggyun Seo

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…

Geometric Topology · Mathematics 2026-03-10 E. Alkin , A. Miroshnikov , A. Skopenkov

We give a new elementary proof of the theorem that a natural map from Milnor's construction $F[S^1]$ to the simplicial group $\mathrm{AP}$ of pure braids is injective. Our approach is group-theoretic and does not rely on Lie algebras.

Group Theory · Mathematics 2025-07-15 Vasily Ionin

Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a…

Applications · Statistics 2021-06-23 Shangsi Wang , Jesús Arroyo , Joshua T. Vogelstein , Carey E. Priebe

We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure…

Machine Learning · Computer Science 2020-10-01 Shay Deutsch , Stefano Soatto

Let $\phi:\mathcal{C}(S)\to\mathcal{C}(S')$ be a simplicial isomorphism between the curve graphs of two infinite-type surfaces. In this paper we show that in this situation $S$ and $S'$ are homeomorphic and $\phi$ is induced by a…

Geometric Topology · Mathematics 2017-06-13 Jesús Hernández Hernández , Israel Morales , Ferrán Valdez

We demonstrate the existence of minimal simplicial $n$-complexes which inevitably contain a nonsplittable two-component link formed by an $(n-1)$-sphere and an $n$-sphere in any embedding into $\mathbb{R}^{2n}$. This provides a…

Geometric Topology · Mathematics 2026-03-17 Ryo Nikkuni

Let $P : \Sigma \rightarrow S$ be a finite degree covering map between surfaces. Rafi and Schleimer show that there is an induced quasi-isometric embedding $\Pi : \mathcal{C}(S) \rightarrow \mathcal{C}(\Sigma)$ between the associated curve…

Geometric Topology · Mathematics 2018-03-16 Robert Tang

We provide the first non-trivial examples of quasi-isometric embeddings between curve complexes. These are induced either by puncturing a closed surface or via orbifold coverings. As a corollary, we give new quasi-isometric embeddings…

Geometric Topology · Mathematics 2014-11-11 Kasra Rafi , Saul Schleimer

Given a map of simplicial topological spaces, mild conditions on degeneracies and the levelwise maps imply that the geometric realization of the simplicial map is a cofibration. These conditions are not formal consequences of model category…

Algebraic Topology · Mathematics 2018-01-31 Gabe Angelini-Knoll , Andrew Salch

Let $g \colon S \looparrowright N$ be a properly immersed $\pi_1$--injective surface in a non-geometric $3$--manifold $N$. We compute the distortion of $\pi_1(S)$ in $\pi_1(N)$ and show that how it is related to separability of $\pi_1(S)$…

Group Theory · Mathematics 2019-07-03 Hoang Thanh Nguyen

Recent increase in the availability of warped images projected onto a manifold (e.g., omnidirectional spherical images), coupled with the success of higher-order assignment methods, has sparked an interest in the search for improved…

Computer Vision and Pattern Recognition · Computer Science 2020-07-30 Charu Sharma , Manohar Kaul

An embedding of a graph on a translation surface is said to be \emph{systolic} if each vertex of the graph corresponds to a singular point (or marked point) and each edge corresponds to a shortest saddle connection on the translation…

Geometric Topology · Mathematics 2025-07-15 Achintya Dey , Bidyut Sanki

Mean value coordinates can be used to map one polygon into another, with application to computer graphics and curve and surface modelling. In this paper we show that if the polygons are quadrilaterals, and if the target quadrilateral is…

Numerical Analysis · Mathematics 2025-06-24 Michael S. Floater , Georg Muntingh

Let $X$ be a contractible $2$-complex which is a union of two contractible subcomplexes $Y$ and $Z.$ Is the intersection $Y\cap Z$ contractible as well? In this note, we prove that the inclusion-induced map $\pi _{1}(Y\cap Z)\rightarrow \pi…

Geometric Topology · Mathematics 2018-10-17 Feng Ji , Shengkui Ye

We call a (not necessarily planar) embedding of a graph $G$ in the plane \emph{sequential} if its vertices lie in $\mathbb Z^2$ and the line segments between adjacent vertices contain no interior integer points. In this note, we prove (i) a…

Combinatorics · Mathematics 2018-12-10 Jackson Autry , Christopher O'Neill

Let $S$ be a split graph with bipartition $(K,I)$ and let $\Phi(S)$ be the factor graph associated with $S$, a multigraph on $I$ whose encodes the combinatorial information about 2-switch transformations in $S$. We study induced paths and…

Combinatorics · Mathematics 2026-04-07 Victor N. Schvöllner , Adrián Pastine

The disjoint union of mapping class groups of surfaces forms a braided monoidal category $\mathcal M$, as the disjoint union of the braid groups $\mathcal B$ does. We give a concrete, and geometric meaning of the braiding $\beta_{r,s}$ in…

Algebraic Topology · Mathematics 2012-05-09 Yongjin Song

The pathwidth of a graph $G$ is the smallest $w\in \mathbb{N}$ such that $G$ can be constructed from a sequence of graphs, each on at most $w+1$ vertices, by gluing them together in a linear fashion. We provide a full classification of the…

Combinatorics · Mathematics 2024-12-30 Maria Chudnovsky , Sepehr Hajebi , Sophie Spirkl