2000 character limit reached
Frobenius and separable functors for the category of entwined modules over cowreaths, I: General theory
Published 30 Dec 2016 in math.CT | (1612.09540v3)
Abstract: Entwined modules over cowreaths in a monoidal category are introduced. They can be identified to coalgebras in an appropriate monoidal category. It is investigated when such coalgebras are Frobenius (resp. separable), and when the forgetful functor from entwined modules to representations of the underlying algebra is Frobenius (resp. separable). These properties are equivalent when the unit object of the category is a $\otimes$-generator.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.