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 discrete-morse-theory
Search options not deleted
user 18263
Discrete Morse Theory is a combinatorial analogue of Morse Theory, introduced by Forman. It provides techniques for computing homological properties of simplicial sets/complexes.
15
votes
Accepted
Discrete Morse theory and chess
The quick answer to your question is no, discrete Morse theory has not been used to study chess moves yet (unless this has been done in some very obscure journal). I would like to highlight a few like …
- 15.5k
7
votes
Discrete Morse theory: how do zig-zag paths determine homotopy type?
Thanks to Cosheaf Overlord Justin Curry for bringing this question to my attention. I'm only going to address the first question here, and I think with some computations (whose complexity depends on y …
- 15.5k
2
votes
Using Discrete Morse Theory to represent hom classes
The answer to your question as stated is no.
What discrete Morse theory gives you, starting from a finite regular CW complex $X$ and a discrete Morse function $f:X \to \mathbb{R}$ (with discrete vec …
- 15.5k
2
votes
Morse matching with 0-cells and (n-1)-cells
Based on the comments under the question, it seems that the real question is as follows:
Let $P$ be a finite poset whose maximal chains have length $\leq n+1$ for some strictly positive $n \in \ma …
- 15.5k