If $G = \langle X | R \rangle$ is a $\delta$-hyperbolic group presentation, then Dehn's algorithm provides a linear time solution to the word problem, but the linear constant is ho …

Can anyone give me an example of a very simple word problem, where by "simple" I mean that it has very few generators and relations, that is nevertheless insoluble. To make the que …

Recall from 1 that a cofibration of strict ω-categories is a retract of relative $I$-cell complexes, where $I$ denotes the set of boundary inclusions $\partial D^n \hookrightarrow …