2000 character limit reached
Generic Constructions and Semidualizing Modules
Published 30 Dec 2019 in math.AC | (1912.13099v1)
Abstract: We investigate some general machinery for describing semidualizing modules over generic constructions like ladder determinantal rings with coefficients in a normal domain. We also pose and investigate natural localization questions that arise in the process.
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.