2000 character limit reached
Weak Factorization Systems for S-acts
Published 1 Feb 2013 in math.GR | (1302.0224v1)
Abstract: The concept of a weak factorization system has been studied extensively in homotopy theory and has recently found an application in one of the proofs of the celebrated flat cover conjecture, categorical versions of which have been presented by a number of authors including Rosicky [15]. One of the main aims of this paper is to draw attention to this interesting concept and to initiate a study of these systems in relation to flatness of $S-$acts and related concepts.
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.