Skip to main content

All Questions

Filter by
Sorted by
Tagged with
8 votes
1 answer
420 views

Can we algorithmically contract loops in a simply connected space?

It is well-known that the question whether a given connected simplicial complex (or simplicial set) is simply connected, is algorithmically undecidable as it can model the word problem. Assuming ...
Peter Franek's user avatar
7 votes
1 answer
310 views

Homotopy between posets

This is entirely a new area for me and I apologise in advance if the questions are silly. In Quillen's paper "Homotopy properties of the posets of non-trivial $p$-subgroup of a group" (see ...
GURI920826's user avatar
4 votes
0 answers
172 views

from 2-cocycle to classifying map

Let $A,E,G:\mathrm{Set}_*\to\mathrm{Grp}_*$ be functors from pointed sets to (discrete) groups ($*=1$) together with natural transformations $i:A\to E, \ p: E\to G$ such that for any set $X$ \begin{...
hsldfgh sfkdlhguh's user avatar
-1 votes
1 answer
421 views

How does the discrete group act on simplicial set level by level

Suppose that we know a discrete group acts on the geometric realization of a simplicial set. Is there some way to understand how the corresponding action works on the simplicial set? For example, if ...
Gao 2Man's user avatar
  • 681