Related papers: Compressed data structures for Heegaard splittings
We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The…
In this paper, we show that, for any integers $n\geq 2$ and $g\geq 2$, there exist genus-$g$ Heegaard splittings of compact 3-manifolds with distance exactly $n$.
A three-manifold equipped with a Heegaard diagram can be used to set up a Floer homology theory whose differential counts pseudo-holomorphic disks in the $g$-fold symmetric product of the Heegaard surface. This leads to a topological…
We define essential and strongly essential triangulations of 3-manifolds, and give four constructions using different tools (Heegaard splittings, hierarchies of Haken 3-manifolds, Epstein-Penner decompositions, and cut loci of Riemannian…
In the curve complex for a surface, a handlebody set is the set of loops that bound properly embedded disks in a given handlebody bounded by the surface. A boundary set is the set of non-separating loops in the curve complex that bound…
This paper presents the construction of the Seiberg-Witten-Floer homology of three-manifolds with non-trivial rational homology, and some properties of the invariant of three-manifolds obtained by computing the Euler characteristic. This…
A simplified trisection is a trisection map on a 4-manifold such that, in its critical value set, there is no double point and cusps only appear in triples on innermost fold circles. We give a necessary and sufficient condition for a…
Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…
Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their adoption in practice has been hindered due to their…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot…
After endowing with a 3-Lie-Rinehart structure on Hom 3-Lie algebras, we obtain a class of special Hom 3-Lie algebras, which have close relationships with representations of commutative associative algebras. We provide a special class of…
We present a new model which represents data as a mixture of simplices. Simplices are geometric structures that generalize triangles. We give a simple geometric understanding that allows us to learn a simplicial structure efficiently. Our…
The classical Seifert algorithm provides an explicit construction of a Seifert surface for any link in $S^3$. Alegria and Menasco extended this construction to integral homology $3$-spheres using Heegaard splittings. In this paper, we…
The manifold which admits a genus-$2$ reducible Heegaard splitting is one of the $3$-sphere, $\mathbb{S}^2 \times \mathbb{S}^1$, lens spaces and their connected sums. For each of those manifolds except most lens spaces, the mapping class…
A discrete harmonic surface is a trivalent graph which satisfies the balancing condition in the 3-dimensional Euclidean space and achieves energy minimizing under local deformations. Given a topological trivalent graph, a holomorphic…
In the 1980s, Neumann and Zagier introduced a symplectic vector space associated to an ideal triangulation of a cusped 3-manifold, such as a knot complement. We give a geometric interpretation for this symplectic structure in terms of the…
Hypergraph spectral analysis has emerged as an effective tool processing complex data structures in data analysis. The surface of a three-dimensional (3D) point cloud and the multilateral relationship among their points can be naturally…
We define an invariant, which we call surface-complexity, of compact 3-manifolds by means of Dehn surfaces. The surface-complexity is a natural number measuring how much the manifold is complicated. We prove that it fulfils interesting…
Lei and Wu have given a description of the second homotopy group of a closed orientable 3-manifold in terms of the kernels of the epimorphisms from the fundamental group of a Heegaard splitting surface onto the fundamental groups of the two…