# Questions tagged [computational-topology]

Computational topology is the study of decidability problems in topology and the algorithms that determine decidability. Examples of area of study include Normal Surface theory and the subproblems of unknot and $S^3$ recognition.

34 questions
Filter by
Sorted by
Tagged with
30 views

### Finite element method reference, from the perspective of the finite elements themselves

I found the finite element chapters in The Finite Element Method of Elliptic Problems especially enlightening and would like to learn more about the theory behind the base components of a general ...
59 views

### Motivation for persistent homology with respect to eigenfunctions of distance kernel operator in a recent preprint

I have a question about a recent preprint https://arxiv.org/pdf/1912.02225.pdf by Maria, Oudot, and Solomon. As far as I understand, in Section 8 they prove that persistent homology (persistence ...
182 views

### Is there an upper bound on the number of points in point cloud for which we compute the persistent homology?

I am interested in the topic of persistent homology (topological data analysis). According to what I read, there is some roadblock in the analysis of "big data" using persistent homology as it is ...
145 views

### The complexity of cutting hackers in a computer network

Let $l_1,l_2,\dots,l_m$ be parallel lines in the plane, say $l_k=\mathbb R\times\{k\}$. On the $k$th line fix a set $V_k$ consisting of $n_k$ points. Let $(V,E)$ be a directed graph whose set of ...
135 views

### Coarsifying persistence modules

The context Let $I=[0,∞)$ and consider the category of persistence modules $(V,π)$ indexed over $I$ satisfying: For all $t$ in $I$ but a closed discrete set of points $T$, there exists a ...
96 views

### Representations of modular lattices, extension to cellular sheaves

There are various "representation theorems" for lattices such as Birkhoff's Representation Theorem that states that every finite distributive lattice is isomorphic to a quasi-sublattice of the lattice ...
97 views

### Discrete Morse theory, choice of Morse function, and removing noise

If I have a simplicial complex, and a discrete Morse function defined on the simplices, I can use persistent homology to produce a barcode which helps me distinguish "persistent" shape from noise. To ...
234 views

### Triangulations of 3-manifolds in Regina and SnapPy

I have been doing some statistical studies on small 3-manifolds, and I note that one can produce larg-ish censuses of triangulations in Regina. Now, the Regina documentation tells us how to convert a ...
336 views

### Products, coproducts and equalizers in category of lattices

Background: Let $\mathbf{Lat}$ be the 2-category of lattices which can be viewed as a subcategory of the 2-cateogry of posets $\mathbf{Pos}$, that is, objects in $\mathbf{Pos}$ that have all finite ...
128 views

### Known obstruction for efficient computation of Stable homotopy groups?

Computation of stable homotopy groups (for example of sphere) is hard, but still, not as hard as unstable ones. For unstable homotopy groups there are some results showing that there cannot be ...
2k views

### Reference on Persistent Homology

I will be teaching a course on algebraic topology for MSc students and this semester, unlike previous ones where I used to begin with the fundamental group, I would like to start with ideas of ...
95 views

### On the entries of a matrix representation for a boundary operator of a persistence module

In equation 6 of Computing Persistent Homology (page 8), the authors put forward the following identity: $$\deg \hat{e_i}+\deg M_k (i,j)=\deg e_j$$ Where $\hat{e_i}$ and $e_j$ are elements of ...
405 views

### Vietoris-Rips complex homology of a higher degree than the ambient dimension

Assuming we have a set of points $X=\{x_1,..,x_n\}$, all in $\mathbb{R}^d$, and construct the Vietoris-Rips-Complex $V_\epsilon (X)$ for some distance parameter $\epsilon > 0$. Is it possible to ...
89 views

### An algorithm to tell if two cut systems are handle slide equivalent?

Let $\Sigma$ be a genus $g$ closed orientable surface and let $\alpha = \{ \alpha_1,...,\alpha_g\}$ and $\beta = \{ \beta_1 ,..., \beta_g \}$ be two cut systems (i.e. nonintersecting homologically ...
2k views

### Why is persistent cohomology so much faster than persistent homology

I refer to this paper: de Silva, Vin; Morozov, Dmitriy; Vejdemo-Johansson, Mikael. Dualities in persistent (co)homology. Inverse Problems 27 (2011), no. 12, 124003, 17 pp. (Journal link, arXiv link). ...
216 views

### Complexity of computing the Vietoris-Rips complex

For me it looks like computing the Vietoris-Rips complex from a data cloud is very similar to the clique problem in graph theory, which it NP-hard. How do the two differ and what is the computational ...
220 views

### Computing the equivariant cohomology class of a Białynicki-Birula cell

One of my current research interests is Hessenberg varieties. Briefly, if $m_1\le m_2\le \cdots \le m_{n-1}$ is a weakly increasing sequence of positive integers such that $i\le m_i\le n$ for all $i$, ...
166 views

1k views

### Computer-aided homology computations

Background I am currently working on the homology of some moduli space and there exists a much simpler chain complex with the same homology. It is a quotient of a bisimplicial complex by a subcomplex....
426 views

### Connected Sum Decomposition of a Knot

Given a composite knot, is it possible to decompose it in prime knots by an algorithm that runs in polynomial time?
897 views

### Computational Topology Paper

I am delving into the field of Computational Topology. I am aware of the books in this field, but could anybody tell me a nice relevant paper in this field which tackles a "typical" Computational ...
922 views

### Homological computations

Suppose I have a group acting on some Hadamard manifold, and I want to understand as much as possible about the (co)homology of the quotient. In my case I can find a fundamental domain for the action ...