相关论文: An algorithm to construct one-vertex triangulation…
A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined. Layered-triangulations are first described for handlebodies and then extended to all 3-manifolds via Heegaard splittings. A complete and detailed…
We provide an algorithm to determine the Heegaard genus of simple 3-manifolds with non-empty boundary. More generally, we supply an algorithm to determine (up to ambient isotopy) all the Heegaard splittings of any given genus for the…
The Heegaard genus is a fundamental invariant of 3-manifolds. However, computing the Heegaard genus of a triangulated 3-manifold is NP-hard, and while algorithms exist, little work has been done in making such an algorithm efficient and…
Heegaard splittings provide a natural representation of closed 3-manifolds by gluing two handlebodies along a common surface. These splittings can be equivalently given by two finite sets of meridians lying on the surface, which define a…
We show that given a partially flat angled ideal triangulation for a 3-manifold $M$ with boundary (as defined by Lackenby), there is an algorithm to produce a list of Heegaard splittings for $M$ such that below a given genus $g$, each…
This paper generalizes the definition of a Heegaard splitting to unify Scharlemann and Thomspon's concept of thin position for 3-manifolds, Gabai's thin position for knots, and Rubinstein's almost normal surface theory. This gives…
We survey known (and unknown) results about the behavior of Heegaard genus of 3-manifolds constructed via various gluings. The constructions we consider are (1) gluing together two 3-manifolds with incompressible boundary, (2) gluing…
We give a new perspective of Heegaard splittings in terms square complexes and Guirardel's notion of a \textit{core} which allows for combinatorial measurement of the obstruction to being a connect sum of Heegaard diagrams. A Heegaard…
The twisted face-pairing construction of our earlier papers gives an efficient way of generating, mechanically and with little effort, myriads of relatively simple face-pairing descriptions of interesting closed 3-manifolds. The…
3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…
We construct simple curves from immersed curves in the setting of handlebodies and Heegaard splittings. We define a measure of complexity we call girth for closed curves in a handlebody. We extend this complexity to Heegaard splittings and…
We construct families of manifolds that have pairs of genus $g$ Heegaard splittings that must be stabilized roughly $g$ times to become equivalent. We also show that when two unstabilized, boundary-unstabilized Heegaard splittings are…
Heegaard splittings stratify 3-manifolds by complexity; only $S^3$ admits a genus-zero splitting, and only $S^3$, $S^1 \times S^2$, and lens spaces $L(p,q)$ admit genus-one splittings. In dimension four, the second author and Jeffrey Meier…
Let $X$ be a bundle over $S^1$ with fiber a 3--manifold $M$ and with monodromy $\varphi$. Gay and Kirby showed that if $\varphi$ fixes a genus $g$ Heegaard splitting of $M$ then $X$ has a genus $6g+1$ trisection. Genus $3g+1$ trisections…
Let $M_1$ and $M_2$ be orientable irreducible 3--manifolds with connected boundary and suppose $\partial M_1\cong\partial M_2$. Let $M$ be a closed 3--manifold obtained by gluing $M_1$ to $M_2$ along the boundary. We show that if the gluing…
Algorithms that decompose a manifold into simple pieces reveal the geometric and topological structure of the manifold, showing how complicated structures are constructed from simple building blocks. This note describes a way to…
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few…
In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
The aim of this article is twofold: firstly, we show how to recover the smooth Deligne-Beilinson cohomology groups from a Heegaard splitting of a closed oriented smooth 3-manifold by extending the usual \tch-de Rham construction; secondly,…