# 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.

**5**

votes

**1**answer

190 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 ...

**10**

votes

**0**answers

115 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 ...

**12**

votes

**2**answers

206 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 ...

**3**

votes

**1**answer

83 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 ...

**3**

votes

**1**answer

138 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 ...

**10**

votes

**0**answers

204 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$, ...

**0**

votes

**1**answer

119 views

### QUBO formulation of a discrete-variable Genetic Algorithm optimization problem

I am facing a non-linear, discrete optimization problem, which I can formulate in this abstract manner: I have a certain non-analytic real-valued function $f$ depending on a set of parameters $ \theta\...

**0**

votes

**1**answer

240 views

### Clarification of “death event” in persistent homology

Before I ask my question let me clarify some notation:
$f^{i,j}_r$, where $i < j$, refers to the inclusion map $f: H_r(X_i) \hookrightarrow H_r(X_j)$. $X_i$ and $X_j$ are subcomplexes of a filtered ...

**1**

vote

**0**answers

89 views

### computing homology of subvarieties of Euclidean spaces by persistent homology

Let $M$ be a submanifold of the Euclidean space $\mathbb{R}^n$. Let $G$ be a finite group acting on $M$ freely. I want to compute the homology (or even the cohomology ring) of $M/G$.
Suppose the ...

**27**

votes

**3**answers

2k views

### What part is left unsolved in the Unknotting problem? (after results of Bar-Natan, Khovanov, Kronheimer and Mrowka)

Kronheimer and Mrowka showed that the Khovanov homology detects the unknot.
Bar-Natan showed a program to compute the Khovanov homology fast: there was no rigorous complexity analysis of the algorithm,...

**7**

votes

**0**answers

229 views

### Translation of Haken's paper “Theorie der Normalflächen”

Haken's paper "Theorie der Normalflächen" is one of the formative papers in the development of normal surface theory and provides an algorithm for detecting the unknot.
While there are now a variety ...

**17**

votes

**3**answers

1k views

### What is the state of the art for algorithmic knot simplification?

Question: Given a `hard' diagram of a knot, with over a hundred crossings, what is the best algorithm and software tool to simplify it? Will it also simplify virtual knot diagrams, tangle diagrams, ...

**33**

votes

**5**answers

6k views

### Inference using Topological Data Analysis: Is it worth it for a regular statistician to learn TDA?

After having read Gunnar Carlsson's Topology and Data I feel enthusiastic to use some topological data analysis (TDA) methods in my current research, mostly in social sciences. We often handle huge ...

**4**

votes

**1**answer

395 views

### Biggest ball included in an intersection of balls

I would like to prove that for any family of balls $\{B(c_i,r_i)\}_i \subset \mathbb{R}^d$ such that $\{c_1, \dots, c_n\} \subset \bigcap_i B(c_i,r_i) $ and $\forall i, r_i \geq 1$, there exists a ...

**3**

votes

**1**answer

347 views

### Are there “geometrically nice” sets from which to construct coverings that admit “Vietoris-Rips like” approximations to the nerve?

It is well known that the nerve (or Čech complex) of a covering consisting of metric balls with a common fixed radius is nicely approximated by the Vietoris-Rips complex. Being a flag complex on its 1-...

**4**

votes

**1**answer

216 views

### Triangulation of the surface determined by sampling two of its cross-sections

I have a data set that essentially looks like the picture below, i.e., it's given by sets of points in $\mathbb{R}^3$ that sample the cross-sections of a certain surface that in principle I do not ...

**21**

votes

**3**answers

2k views

### Persistent homology of Gaussian Fields in Euclidean space

If you generate points in $\mathbb R^n$ via a process that respects a Gaussian normal distribution, then compute the persistent homology / barcodes, to my eye something fairly regular seems to be ...

**14**

votes

**3**answers

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....

**5**

votes

**1**answer

589 views

### Persistent homology of Markovian dynamical systems

Consider a dynamical system $(T,X)$ that admits a Markov partition $\mathcal{M}$ (e.g., an Anosov map), and consider the corresponding 0-1 transition matrix $A$. It is commonplace to study information ...

**3**

votes

**0**answers

411 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?

**2**

votes

**2**answers

875 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 ...

**8**

votes

**2**answers

870 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 ...

**10**

votes

**4**answers

2k views

### Reference request for manifold learning

I am interested in learning about manifold learning (no pun intended) and would like to know of some references that discuss the subject from a more geometric perspective. By manifold learning I mean ...

**28**

votes

**4**answers

6k views

### Computational software in Algebraic Topology?

I was wondering if there is any good software out there that allows you to do specific computations in algebraic topology. For example:
Create a simplicial complex/set and ask questions about its ...