[Paper Review] Classification and Models of Simply-connected Trivalent $2$-dimensional Stratifolds

J. C. Gómez-Larrañaga, F. González-Acuña+1 more|arXiv (Cornell University)|Nov 23, 2016

Topological and Geometric Data Analysis5 references3 citations

TL;DR

This paper classifies simply-connected trivalent 2-dimensional stratifolds using labeled bipartite graphs, proving that such stratifolds correspond precisely to graphs generated from a single white vertex via two operations: O1 (joining two graphs at white vertices) and O2 (modifying a vertex with three edges labeled 1). The key contribution is a complete combinatorial characterization of all simply-connected trivalent 2-stratifolds through these operations.

ABSTRACT

Trivalent $2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where three sheets meet. We obtain a classification of $1$-connected $2$-stratifolds in terms of their associated labeled graphs and develop operations that will construct from a single vertex all graphs that represent $1$-connected $2$-stratifolds.

Motivation & Objective

• To classify all simply-connected trivalent 2-dimensional stratifolds using their associated labeled graphs.
• To identify necessary and sufficient conditions on labeled graphs for the corresponding stratifold to be simply connected.
• To develop constructive operations that generate all such graphs from a minimal starting point.
• To establish a complete combinatorial model for simply-connected trivalent 2-stratifolds using graph operations.
• To provide a foundational framework for understanding the fundamental group and topological structure of 2-stratifolds in 3-manifold theory.

Proposed method

• Represent each trivalent 2-stratifold by a labeled bipartite graph, where white vertices denote surface components (with genus), and edges are labeled by the summands of the permutation defining the neighborhood of each 1-skeleton component.
• Use operation O1* to join two labeled graphs by connecting any white vertex of one to any white vertex of another, preserving the fundamental group as the free product.
• Use operation O2 to modify a graph by replacing a black vertex of degree 3 with three edges labeled 1, preserving the fundamental group.
• Define a hierarchy of graph families: start with a single white vertex, then iteratively apply O1* and O2 to generate all graphs in the set 𝒢.
• Prove that any simply-connected trivalent 2-stratifold must arise from this construction via induction on the number of black vertices.
• Leverage known results on fundamental groups of 2-stratifolds and the fact that simply connected spaces have trivial fundamental group to constrain the possible graph structures.

Experimental results

Research questions

• RQ1 Which labeled trivalent graphs correspond to simply-connected 2-stratifolds?
• RQ2 Can all simply-connected trivalent 2-stratifolds be constructed from a single white vertex using explicit graph operations?
• RQ3 What operations preserve the fundamental group while generating new graphs representing simply-connected stratifolds?
• RQ4 How do the edge labels and vertex genera in the graph relate to the topological invariants of the stratifold?
• RQ5 Is there a complete and finite combinatorial characterization of all simply-connected trivalent 2-stratifolds?

Key findings

• A trivalent 2-stratifold is simply connected if and only if its associated labeled graph is in the set 𝒢, which is generated from a single white vertex using operations O1* and O2.
• Operation O1* preserves the fundamental group as the free product of the groups of the two input graphs, and is used to combine disjoint components.
• Operation O2 preserves the fundamental group and is used to replace a black vertex with three degree-1 edges, maintaining simply connectedness.
• The classification relies on the fact that any simply connected trivalent 2-stratifold must have a labeled graph that is a tree with all white vertices of genus 0 and only edge labels 1 or 2.
• The proof uses induction on the number of black vertices, showing that any such graph can be reduced via O2 or O1* to a single vertex, confirming membership in 𝒢.
• The construction is complete: every simply-connected trivalent 2-stratifold arises from the iterative application of O1* and O2 starting from a single white vertex.