52 citations · 217 across the 45 of their papers we have counts for
Showing math.CTShow all
3 papers · 1 filter
math.CT2011★ 9 cited
On diagram-chasing in double complexes
George M. Bergman
Diagram-chasing arguments frequently lead to "magical" relations between distant points of diagrams: exactness implications, connecting morphisms, etc.. These long connections are…
math.CT2007★ 3 cited
Colimits of representable algebra-valued functors
George M. Bergman
If C and D are varieties of algebras in the sense of general algebra, then by a representable functor C --> D we understand a functor which, when composed with the forgetful functo…
math.CT2003★ 4 cited
Direct limits and fixed point sets
George M. Bergman
For which groups G is it true that whenever we form a direct limit of G-sets, dirlim_{i\in I} X_i, the set of its fixed points, (dirlim_I X_i)^G, can be obtained as the direct limi…