Recursive coalgebras of finitary functors
For finitary set functors preserving inverse images, recursive coalgebras A of Paul Taylor are proved to be precisely those for which the system described by A always halts in finitely many steps.
For finitary set functors preserving inverse images, recursive coalgebras A of Paul Taylor are proved to be precisely those for which the system described by A always halts in finitely many steps.
As generalizations of separable and Frobenius algebras, separable and Frobenius monoidal Hom-algebras are introduced. They are all related to the Hom-Frobenius-separability equation (HFS-equation). We characterize these two Hom-algebraic structures by the same central element and different normalizing conditions, and the structure of these two types of monoidal Hom-algebras is studied. The Nakayama automorphisms of Frobenius monoidal Hom-algebras are considered.
We start with a small paradigm shift about group representations, namely the observation that restriction to a subgroup can be understood as an extension-of-scalars. We deduce that, given a group , the derived and the stable categories of representations of a subgroup can be constructed out of the corresponding category for by a purely triangulated-categorical construction, analogous to étale extension in algebraic geometry. In the case of finite groups, we then use descent methods to investigate...