Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computational-topology
Search options not deleted
user 39521
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.
19
votes
Accepted
Vietoris-Rips complex homology of a higher degree than the ambient dimension
I have examples for $\ell_2$ distance in $\mathbb{R}^2$.
In particular, take $2n+2$ points at the vertices of a regular polygon of unit radius, and set the distance parameter to be slightly less than …
- 12.4k