Timeline for Which properties of finite simplicial sets can be computed?
Current License: CC BY-SA 2.5
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 15, 2021 at 9:54 | history | wiki removed | Stefan Kohl♦ | ||
| Nov 10, 2010 at 10:47 | answer | added | Neil Strickland | timeline score: 5 | |
| Sep 30, 2010 at 8:50 | comment | added | Matthias Künzer | Zisman deals with finite simplicial sets here: arxiv.org/abs/0909.2143 . | |
| Apr 23, 2010 at 18:45 | comment | added | John Palmieri | David Anick's paper "The computation of rational homotopy groups is #P-hard" discusses finite simply-connected CW complexes rather than simplicial sets; is that relevant? | |
| Apr 23, 2010 at 12:17 | history | edited | user4676 | CC BY-SA 2.5 |
added 4 characters in body
|
| Apr 23, 2010 at 12:17 | vote | accept | user4676 | ||
| Apr 23, 2010 at 7:11 | comment | added | user2146 | So far sage seems to be able to compute with finite simplicial complexes and delta complexes [1]. Some operations of spaces are implemented and CHomP can be used to compute their homology. [1] sagemath.org/doc/reference/homology.html | |
| Apr 23, 2010 at 7:10 | history | edited | user4676 | CC BY-SA 2.5 |
added 102 characters in body
|
| Apr 23, 2010 at 7:07 | comment | added | user4676 | This was stupid, there are no non-discrete finite Kan complexes. Thanks, Tilman. | |
| Apr 22, 2010 at 21:44 | comment | added | Tilman | Are there any non-discrete finite Kan complexes? | |
| Apr 22, 2010 at 21:21 | answer | added | Jesse Burke | timeline score: 9 | |
| Apr 22, 2010 at 19:52 | answer | added | Carl Mummert | timeline score: 9 | |
| Apr 22, 2010 at 18:35 | history | edited | François G. Dorais |
edited tags
|
|
| Apr 22, 2010 at 18:27 | history | edited | user4676 | CC BY-SA 2.5 |
added 9 characters in body
|
| Apr 22, 2010 at 18:22 | history | asked | user4676 | CC BY-SA 2.5 |