2000 character limit reached
Harder-Narasimhan filtrations for Breuil-Kisin-Fargues modules
Published 10 Jan 2018 in math.AG and math.NT | (1801.03341v1)
Abstract: We define and study Harder-Narasimhan filtrations on Breuil-Kisin-Fargues modules and related objects relevant to p-adic Hodge theory.
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.