Related papers: Compressed data structures for Heegaard splittings

We consider the family of Heegaard splittings of genus $g$ at least three which are defined via a glueing map that is the $n$-th power of the Dehn twist along a curve that satisfies a natural topological assumption, namely pared…

Bordered Floer homology assigns invariants to 3-manifolds with boundary, such that the Heegaard Floer homology of a closed 3-manifold, split into two pieces, can be recovered as a tensor product of the bordered invariants of the pieces. We…

We define sutured Heegaard diagrams for null-homologous knots in 3-manifolds. These diagrams are useful for computing the knot Floer homology at the top filtration level. As an application, we give a formula for the knot Floer homology of a…

We describe an example of a closed orientable 3-manifold with distinct distance three genus two Heegaard splittings. This demonstrates that the constructions of alternate genus two Heegaard splittings of closed orientable 3-manifolds…

Shapes of four dimensional spaces can be studied effectively via maps to standard surfaces. We explain, and illustrate by quintessential examples, how to simplify such generic maps on 4-manifolds topologically, in order to derive simple…

In this paper, we will compute the dimension of the space of spun and ordinary normal surfaces in an ideal triangulation of the interior of a compact 3-manifold with incompressible tori or Klein bottle components. Spun normal surfaces have…

Closed (and simply-connected) manifolds whose dimensions are larger than 4 are central geometric objects in classical algebraic topology and differential topology. They have been classified via algebraic and abstract objects. On the other…

We elaborate on a general method that we recently introduced for characterizing the "natural" structures in complex physical systems via a multiscale network based approach for the data mining of such structures. The approach is based on…

A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…

We consider a Heegaard splitting M=H_1 \cup_S H_2 of a 3-manifold M having an essential disk D in H_1 and an essential surface F in H_2 with |D \cap F|=1. (We require that boundary of F is in S when H_2 is a compressionbody with non-empty…

Current paper introduces a Hypergraph Graph model of data storage which can be represented as a hybrid data structure based on Hypergraph and Graph. The pro-posed data structure is claimed to realize complex combinatorial structures. The…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

Hypergraphs, which use hyperedges to capture groupwise interactions among different entities, have gained increasing attention recently for their versatility in effectively modeling real-world networks. In this paper, we study the problem…

We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…

Graphs and hypergraphs combine expressive modeling power with algorithmic efficiency for a wide range of applications. Hedgegraphs generalize hypergraphs further by grouping hyperedges under a color/hedge. This allows hedgegraphs to model…

In healthcare, accurately classifying medical images is vital, but conventional methods often hinge on medical data with a consistent grid structure, which may restrict their overall performance. Recent medical research has been focused on…

Manifold embedding algorithms map high-dimensional data down to coordinates in a much lower-dimensional space. One of the aims of dimension reduction is to find intrinsic coordinates that describe the data manifold. The coordinates returned…

In a previous work a procedure was decribed for dividing the $3 \times N$-dimensional conformational space of a molecular system into a number of discrete cells, this partition allowed the building of a combinatorial structure from data…

In a recent paper, {\it Algorithms for Deforming and Contracting Simply Connected Discrete Closed Manifolds (II)}, we discussed two algorithms for deforming and contracting a simply connected discrete closed manifold into a discrete sphere.…

There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…