Consider a push-out diagram of spaces C B, construct the homotopy push-out, and then the homotopy pull-back of the diagram one gets by forgetting the initial object A. We compare the difference between A and this homotopy pull-back. This difference ...
Let X be a simplicial set. We construct a novel adjunction be- tween the categories RX of retractive spaces over X and ComodX+ of X+- comodules, then apply recent work on left-induced model category structures [5], [16] to establish the existence of a left ...
We present and discuss current waveforms associated with 13 bipolar lightning flashes recorded at the Santis Tower during the period from June 2010 to January 2015. During this period, a total of 427 flashes were recorded, of which 13 (3%) were classified ...
Kan spectra provide a combinatorial model for the stable homotopy category. They were introduced by Dan Kan in 1963 under the name semisimplicial spectra. A Kan spectrum is similar to a pointed simplicial set, but it has simplices in negative degrees as we ...
Consider a fibration sequence of topological spaces which is preserved as such by some functor , so that is again a fibration sequence. Pull the fibration back along an arbitrary map into the base space. Does the pullback fibration enjoy the same property? ...
We prove existence results à la Jeff Smith for left-induced model category structures, of which the injective model structure on a diagram category is an important example. We further develop the notions of fibrant generation and Postnikov presentation fro ...
Let G be a finite group and R be a commutative ring. The Mackey algebra μR(G) shares a lot of properties with the group algebra RG however, there are some differences. For example, the group algebra is a symmetric algebra and this is not always the case fo ...
Let K be a comonad on a model category M. We provide conditions under which the associated category of K-coalgebras admits a model category structure such that the forgetful functor to M creates both cofibrations and weak equivalences. We provide concrete ...
For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k >= 2, there is a polynomial-time algorithm that, for a 1-connected topological space X given as a f ...
