2000 character limit reached
Two new motivic complexes for non-smooth schemes
Published 23 May 2024 in math.AG, math.KT, and math.NT | (2405.14340v1)
Abstract: These are expanded notes from a talk at the RIMS Workshop, Algebraic Number Theory and Related Topics, December 13th, 2023. We discussed Elmanto-Morrow's motivic complex, the procdh sheafification of the classical motivic complex, and their comparison. The procdh topology and the comparison is joint work with Shuji Saito. The comparison was obtained through joint discussion with Morrow, and its proof relies heavily on the main results of [EM23].
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.
